Results 1  10
of
90
Cones of matrices and setfunctions and 01 optimization
 SIAM JOURNAL ON OPTIMIZATION
, 1991
"... It has been recognized recently that to represent a polyhedron as the projection of a higher dimensional, but simpler, polyhedron, is a powerful tool in polyhedral combinatorics. We develop a general method to construct higherdimensional polyhedra (or, in some cases, convex sets) whose projection a ..."
Abstract

Cited by 259 (7 self)
 Add to MetaCart
It has been recognized recently that to represent a polyhedron as the projection of a higher dimensional, but simpler, polyhedron, is a powerful tool in polyhedral combinatorics. We develop a general method to construct higherdimensional polyhedra (or, in some cases, convex sets) whose projection approximates the convex hull of 01 valued solutions of a system of linear inequalities. An important feature of these approximations is that one can optimize any linear objective function over them in polynomial time. In the special case of the vertex packing polytope, we obtain a sequence of systems of inequalities, such that already the first system includes clique, odd hole, odd antihole, wheel, and orthogonality constraints. In particular, for perfect (and many other) graphs, this first system gives the vertex packing polytope. For various classes of graphs, including tperfect graphs, it follows that the stable set polytope is the projection of a polytope with a polynomial number of facets. We also discuss an extension of the method, which establishes a connection with certain submodular functions and the Möbius function of a lattice.
Edmonds polytopes and a hierarchy of combinatorial problems
, 2006
"... Let S be a set of linear inequalities that determine a bounded polyhedron P. The closure of S is the smallest set of inequalities that contains S and is closed under two operations: (i) taking linear combinations of inequalities, (ii) replacing an inequality Σaj xj ≤ a0, where a1,a2,...,an are integ ..."
Abstract

Cited by 143 (0 self)
 Add to MetaCart
Let S be a set of linear inequalities that determine a bounded polyhedron P. The closure of S is the smallest set of inequalities that contains S and is closed under two operations: (i) taking linear combinations of inequalities, (ii) replacing an inequality Σaj xj ≤ a0, where a1,a2,...,an are integers, by the inequality Σaj xj ≤ a with a ≥[a0]. Obviously, if integers x1,x2,...,xn satisfy all the inequalities in S, then they satisfy also all inequalities in the closure of S. Conversely, let Σcj xj ≤ c0 hold for all choices of integers x1,x2,...,xn, that satisfy all the inequalities in S. Then we prove that Σcj xj ≤ c0 belongs to the closure of S. To each integer linear programming problem, we assign a nonnegative integer, called its rank. (The rank is the minimum number of iterations of the operation (ii) that are required in order to eliminate the integrality constraint.) We prove that there is no upper bound on the rank of problems arising from the search for largest independent sets in graphs.
The Maximum Clique Problem
, 1999
"... Contents 1 Introduction 2 1.1 Notations and Definitions . . . . . . . . . . . . . . . . . . . . . . . . 3 2 Problem Formulations 4 2.1 Integer Programming Formulations . . . . . . . . . . . . . . . . . . . 5 2.2 Continuous Formulations . . . . . . . . . . . . . . . . . . . . . . . . 8 3 Computation ..."
Abstract

Cited by 140 (20 self)
 Add to MetaCart
Contents 1 Introduction 2 1.1 Notations and Definitions . . . . . . . . . . . . . . . . . . . . . . . . 3 2 Problem Formulations 4 2.1 Integer Programming Formulations . . . . . . . . . . . . . . . . . . . 5 2.2 Continuous Formulations . . . . . . . . . . . . . . . . . . . . . . . . 8 3 Computational Complexity 12 4 Bounds and Estimates 15 5 Exact Algorithms 19 5.1 Enumerative Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . 19 5.2 Exact Algorithms for the Unweighted Case . . . . . . . . . . . . . . 21 5.3 Exact Algorithms for the Weighted Case . . . . . . . . . . . . . . . . 25 6 Heuristics 27 6.1 Sequential Greedy Heuristics . . . . . . . . . . . . . . . . . . . . . . 28 6.2 Local Search Heuristics . . . . . . . . . . . . . . . . . . . . . . . . . 29 6.3 Advanced Search Heuristics . . . . . . . . . . . . . . . . . . . . . . . 30 6.3.1 Simulated annealing . . . . . . . . . . . . . . . . . . . . . . . 30 6.3.2 Neural networks . . . . . . . . . . . . . . . . . . . . . . . .
Semidefinite Programming and Integer Programming
"... We survey how semidefinite programming can be used for finding good approximative solutions to hard combinatorial optimization problems. ..."
Abstract

Cited by 47 (7 self)
 Add to MetaCart
We survey how semidefinite programming can be used for finding good approximative solutions to hard combinatorial optimization problems.
Decomposition of Balanced Matrices
 J. COMBINATORIAL THEORY, SER. B
, 1999
"... A 0,1 matrix is balanced if it does not contain a square submatrix of odd order with two ones per row and per column. We show that a balanced 0,1 matrix is either totally unimodular or its bipartite representation has a cutset consisting of two adjacent nodes and some of their neighbors. This resul ..."
Abstract

Cited by 29 (5 self)
 Add to MetaCart
A 0,1 matrix is balanced if it does not contain a square submatrix of odd order with two ones per row and per column. We show that a balanced 0,1 matrix is either totally unimodular or its bipartite representation has a cutset consisting of two adjacent nodes and some of their neighbors. This result yields a polytime recognition algorithm for balancedness. To prove the result, we first prove a decomposition theorem for balanced 0,1 matrices that are not strongly balanced.
Semidefinite programs and combinatorial optimization (Lecture notes)
, 1995
"... this paper, we are only concerned about the last question, which can be answered using semidefinite programming. For a survey of other aspects of such geometric representations, see [64]. ..."
Abstract

Cited by 29 (1 self)
 Add to MetaCart
this paper, we are only concerned about the last question, which can be answered using semidefinite programming. For a survey of other aspects of such geometric representations, see [64].
Approximation Results for the Optimum Cost Chromatic Partition Problem
 J. Algorithms
"... . In this paper, we study the optimum cost chromatic partition (OCCP) problem for several graph classes. The OCCP problem is the problem of coloring the vertices of a graph such that adjacent vertices get different colors and that the total coloring costs are minimum. We prove several approximation ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
. In this paper, we study the optimum cost chromatic partition (OCCP) problem for several graph classes. The OCCP problem is the problem of coloring the vertices of a graph such that adjacent vertices get different colors and that the total coloring costs are minimum. We prove several approximation results for the OCCP problem restricted to bipartite, chordal, comparability, interval, permutation, split and unimodular graphs. We prove that there exists no polynomial approximation algorithm with ratio O(jV j 0:5 ) for the OCCP problem restricted to bipartite and interval graphs, unless P = NP . Furthermore, we propose approximation algorithms with ratio O(jV j 0:5 ) for bipartite, interval and unimodular graphs. Finally, we prove that there exists no polynomial approximation algorithm with ratio O(jV j 1 ) for the OCCP problem restricted to split, chordal, permutation and comparability graphs, unless P = NP .
The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs
 GraphTheoretic Concepts in Computer Science (Cadenabbia, 1996), Lecture Notes in Computer Science
, 1996
"... In this paper we study the Optimal Cost Chromatic Partition (OCCP) problem for trees and interval graphs. The OCCP problem is the problem of coloring the nodes of a graph in such a way that adjacent nodes obtain different colors and that the total coloring costs are minimum. ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
In this paper we study the Optimal Cost Chromatic Partition (OCCP) problem for trees and interval graphs. The OCCP problem is the problem of coloring the nodes of a graph in such a way that adjacent nodes obtain different colors and that the total coloring costs are minimum.
BeliefPropagation for Weighted bMatchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
 in arXiv, http://www.arxiv.org/abs/0709.1190v1
, 2007
"... We consider the general problem of finding the minimum weight bmatching on arbitrary graphs. We prove that, whenever the linear programming (LP) relaxation of the problem has no fractional solutions, then the belief propagation (BP) algorithm converges to the correct solution. This result is notabl ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
We consider the general problem of finding the minimum weight bmatching on arbitrary graphs. We prove that, whenever the linear programming (LP) relaxation of the problem has no fractional solutions, then the belief propagation (BP) algorithm converges to the correct solution. This result is notable in several regards: (1) It is one of a very small number of proofs showing correctness of BP without any constraint on the graph structure. (2) Instead of showing that BP leads to a PTAS, we give a finite bound for the number of iterations after which BP has converged to the exact solution. (3) Variants of the proof work for both synchronous and asynchronous BP; to the best of our knowledge, it is the first proof of convergence and correctness of an asynchronous BP algorithm for a combinatorial optimization problem. (4) It works for both ordinary bmatchings and the more difficult case of perfect bmatchings. (5) Together with the recent work of Sanghavi, Malioutov and Wilskly [41] they are the first complete proofs showing that tightness of LP implies correctness of BP. 1
shellable and unmixed clutters with a perfect matching of König type
 J. Pure Appl. Alg
"... Abstract. Let C be a clutter with a perfect matching e1,..., eg of König type and let ∆C be the StanleyReisner complex of the edge ideal of C. If all cminors of C have a free vertex and C is unmixed, we show that ∆C is pure shellable. We are able to describe, in combinatorial and algebraic terms, ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
Abstract. Let C be a clutter with a perfect matching e1,..., eg of König type and let ∆C be the StanleyReisner complex of the edge ideal of C. If all cminors of C have a free vertex and C is unmixed, we show that ∆C is pure shellable. We are able to describe, in combinatorial and algebraic terms, when ∆C is pure. If C has no cycles of length 3 or 4, then it is shown that ∆C is pure if and only if ∆C is pure shellable (in this case ei has a free vertex for all i), and that ∆C is pure if and only if for any two edges f1, f2 of C and for any ei, one has that f1 ∩ei ⊂ f2 ∩ei or f2 ∩ei ⊂ f1 ∩ei. It is also shown that this ordering condition implies that ∆C is pure shellable, without any assumption on the cycles of C. Then we prove that complete admissible uniform clutters and their Alexander duals are unmixed. In addition, the edge ideals of complete admissible uniform clutters are facet ideals of shellable simplicial complexes, they are CohenMacaulay, and they have linear resolutions. Furthermore if C is admissible and complete, then C is unmixed. We characterize certain conditions that occur in a CohenMacaulay criterion for bipartite graphs of Herzog and Hibi, and extend some results of Faridi—on the structure of unmixed simplicial trees—to clutters with the König property without 3cycles or 4cycles. 1.