Lower bounds to the graph partitioning problem through generalized linear programming and network flows
Max-separable equations and the set covering
Nonlinear mixed zero-one Programming: Practical and Theoretical Aspects
Odd cycles and a class of facets of the axial 3-index assignment polytope
On co-bicliques
A co-biclique of a simple undirected graph G = (V,E) is the edge-set of two disjoint complete subgraphs of G. (A co-biclique is the complement of a biclique.) A subset F ⊆ E is an independent of G if there is a co-biclique B such that F ⊆ B, otherwise F is a dependent of G. This paper describes the minimal dependents of G. (A minimal dependent is a dependent C such that any proper subset of C is an independent.) It is showed that a minimum-cost dependent set of G can be determined in polynomial...
On stability of some lexicographic multicriteria Boolean problem
On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls.
On the structure of the quadratic Boolean problem polytope
Optimization of unimodal monotone pseudoboolean functions
Original title unknown
Placement de tâches dans un système distribué et dualité lagrangienne
Problème de la bipartition minimale d'un graphe
Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution
Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution
Fractional programming consists in optimizing a ratio of two functions subject to some constraints. Different versions of this model, linear or nonlinear, have applications in various fields like combinatorial optimization, stochastic programming, data bases, and economy. Three resolution methods are presented: direct solution, parametric approach and solution of an equivalent problem.
Product form parametric representation of the solutions to a quadratic boolean equation
Programmation bivalente à plusieurs fonctions économiques
Programmation hyperbolique en variables bivalentes
Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
Selection of search strategies for solving 3-sat problems
Some remarks on quadratic programming with 0-1 variables