Implémentation optimale d'une relation dans une base de données relationnelle par un système de projecteurs
Réductions et conditions d'optimalité dans le problème de l'ensemble stable de poids maximal
On interval graphs and matrice profiles
Brève communication. Transformation du problème de partitionnement en un problème d'ensemble stable de poids maximal
Une nouvelle méthode pour le problème de partitionnement fondée sur une évaluation par excès de la solution
Comparaison expérimentale d'algorithmes pour les problèmes de recouvrement et de maximisation d'une fonction pseudo-booléenne
Solution of a fractional combinatorial optimization problem by mixed integer programming
Fractionnal mathematical programs appear in numerous operations research, computer science and economic domains. We consider in this paper the problem of maximizing the sum of 0–1 hyperbolic ratios (SRH). In contrast to the single ratio problem, there has been little work in the literature concerning this problem. We propose two mixed-integer linear programming formulations of SRH and develop two different strategies to solve them. The first one consists in using directly a general-purpose mixed-integer...
A comparison of three algorithms for reducing the profile of a sparse matrix
Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
Many combinatorial optimization problems can be formulated as the minimization of a 0–1 quadratic function subject to linear constraints. In this paper, we are interested in the exact solution of this problem through a two-phase general scheme. The first phase consists in reformulating the initial problem either into a compact mixed integer linear program or into a 0–1 quadratic convex program. The second phase simply consists in submitting the reformulated problem to a standard solver. The efficiency...
Page 1