Results 1  10
of
23
A comparison of the SheraliAdams, LovászSchrijver and Lasserre relaxations for 01 programming
 Mathematics of Operations Research
, 2001
"... ..."
Cuts for mixed 01 conic programming
, 2005
"... In this we paper we study techniques for generating valid convex constraints for mixed 01 conic programs. We show that many of the techniques developed for generating linear cuts for mixed 01 linear programs, such as the Gomory cuts, the liftandproject cuts, and cuts from other hierarchies of ti ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
In this we paper we study techniques for generating valid convex constraints for mixed 01 conic programs. We show that many of the techniques developed for generating linear cuts for mixed 01 linear programs, such as the Gomory cuts, the liftandproject cuts, and cuts from other hierarchies of tighter relaxations, extend in a straightforward manner to mixed 01 conic programs. We also show that simple extensions of these techniques lead to methods for generating convex quadratic cuts. Gomory cuts for mixed 01 conic programs have interesting implications for comparing the semidefinite programming and the linear programming relaxations of combinatorial optimization problems, e.g. we show that all the subtour elimination inequalities for the traveling salesman problem are rank1 Gomory cuts with respect to a single semidefinite constraint. We also include results from our preliminary computational experiments with these cuts.
A strong conic quadratic reformulation for machinejob assignment with controllable processing times
 OPERATIONS RESEARCH LETTERS
, 2009
"... ..."
A semidefinite programming based polyhedral cut and price approach for the maxcut problem
 Computational Optimization and Applications
, 2006
"... Abstract. We investigate solution of the maximum cut problem using a polyhedral cut and price approach. The dual of the wellknown SDP relaxation of maxcut is formulated as a semiinfinite linear programming problem, which is solved within an interior point cutting plane algorithm in a dual setting; ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
Abstract. We investigate solution of the maximum cut problem using a polyhedral cut and price approach. The dual of the wellknown SDP relaxation of maxcut is formulated as a semiinfinite linear programming problem, which is solved within an interior point cutting plane algorithm in a dual setting; this constitutes the pricing (column generation) phase of the algorithm. Cutting planes based on the polyhedral theory of the maxcut problem are then added to the primal problem in order to improve the SDP relaxation; this is the cutting phase of the algorithm. We provide computational results, and compare these results with a standard SDP cutting plane scheme. semidefinite programming, column generation, cutting plane methods, combinatorial optimizaKeywords: tion
An Improved Semidefinite Programming Relaxation for the Satisfiability Problem
, 2002
"... The satisfiability (SAT) problem is a central problem in mathematical logic, computing theory, and artificial intelligence. An instance of SAT is specified by a set of boolean variables and a propositional formula in conjunctive normal form. Given such an instance, the SAT problem asks whether there ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
(Show Context)
The satisfiability (SAT) problem is a central problem in mathematical logic, computing theory, and artificial intelligence. An instance of SAT is specified by a set of boolean variables and a propositional formula in conjunctive normal form. Given such an instance, the SAT problem asks whether there is a truth assignment to the variables such that the formula is satisfied. It is well known that SAT is in general NPcomplete, although several important special cases can be solved in polynomial time. Semidefinite programming (SDP) refers to the class of optimization problems where a linear function of a matrix variable X is maximized (or minimized) subject to linear constraints on the elements of X and the additional constraint that X be positive semidefinite. We are interested in the application of SDP to satisfiability problems, and in particular in how SDP can be used to detect unsatisfiability. In this paper we introduce a new SDP relaxation for the satisfiability problem. This SDP relaxation arises from the recently introduced paradigm of “higher liftings” for constructing semidefinite programming relaxations of discrete optimization problems.
Semidefinite Relaxations for MaxCut
 The Sharpest Cut, Festschrift in Honor of M. Padberg's 60th Birthday. SIAM
, 2001
"... We compare several semidefinite relaxations for the cut polytope obtained by applying the lift and project methods of Lov'asz and Schrijver and of Lasserre. We show that the tightest relaxation is obtained when aplying the Lasserre construction to the node formulation of the maxcut problem. Th ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
(Show Context)
We compare several semidefinite relaxations for the cut polytope obtained by applying the lift and project methods of Lov'asz and Schrijver and of Lasserre. We show that the tightest relaxation is obtained when aplying the Lasserre construction to the node formulation of the maxcut problem. This relaxation Q t (G) can be defined as the projection on the edge subspace of the set F t (n), which consists of the matrices indexed by all subsets of [1; n] of cardinality t + 1 with the same parity as t + 1 and having the property that their (I ; J)th entry depends only on the symmetric difference of the sets I and J . The set F 0 (n) is the basic semidefinite relaxation of maxcut consisting of the semidefinite matrices of order n with an all ones diagonal, while Fn\Gamma2 (n) is the 2 n\Gamma1 dimensional simplex with the cut matrices as vertices. We show the following geometric properties: If Y 2 F t (n) has rank t + 1, then Y can be written as a convex combination of at most 2 t cut matrices, extending a result of Anjos and Wolkowicz for the case t = 1; any 2 t+1 cut matrices form a face of F t (n) for t = 0; 1; n \Gamma 2. The class L t of the graphs G for which Q t (G) is the cut polytope of G is shown to be closed under taking minors. The graph K 7 is a forbidden minor for membership in L 2 , while K 3 and K 5 are the only minimal forbidden minors for the classes L 0 and L 1 , respectively. 1
Interior point and semidefinite approaches in combinatorial optimization
, 2005
"... Conic programming, especially semidefinite programming (SDP), has been regarded as linear programming for the 21st century. This tremendous excitement was spurred in part by a variety of applications of SDP in integer programming (IP) and combinatorial optimization, and the development of efficient ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
(Show Context)
Conic programming, especially semidefinite programming (SDP), has been regarded as linear programming for the 21st century. This tremendous excitement was spurred in part by a variety of applications of SDP in integer programming (IP) and combinatorial optimization, and the development of efficient primaldual interiorpoint methods (IPMs) and various first order approaches for the solution of large scale SDPs. This survey presents an up to date account of semidefinite and interior point approaches in solving NPhard combinatorial optimization problems to optimality, and also in developing approximation algorithms for some of them. The interior point approaches discussed in the survey have been applied directly to nonconvex formulations of IPs; they appear in a cutting plane framework to solving IPs, and finally as a subroutine to solving SDP relaxations of IPs. The surveyed approaches include nonconvex potential reduction methods, interior point cutting plane methods, primaldual IPMs and firstorder algorithms for solving SDPs, branch and cut approaches based on SDP relaxations of IPs, approximation algorithms based on SDP formulations, and finally methods employing successive convex approximations of the underlying combinatorial optimization problem.
Tighter linear and semidefinite relaxations for maxcut based on the LovászSchrijver liftandproject procedure
 SIAM JOURNAL ON OPTIMIZATION
, 2001
"... We study how the liftandproject method introduced by Lovász and Schrijver [SIAM J. Optim., 1 (1991), pp. 166–190] applies to the cut polytope. We show that the cut polytope of a graph can be found in k iterations if there exist k edges whose contraction produces a graph with no K5minor. Therefor ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
(Show Context)
We study how the liftandproject method introduced by Lovász and Schrijver [SIAM J. Optim., 1 (1991), pp. 166–190] applies to the cut polytope. We show that the cut polytope of a graph can be found in k iterations if there exist k edges whose contraction produces a graph with no K5minor. Therefore, for a graph G with n ≥ 4 nodes with stability number α(G), n − 4 iterations suffice instead of the m (number of edges) iterations required in general and, under some assumption, n − α(G) − 3 iterations suffice. The exact number of needed iterations is determined for small n ≤ 7 by a detailed analysis of the new relaxations. If positive semidefiniteness is added to the construction, then one finds in one iteration a relaxation of the cut polytope which is tighter than its basic semidefinite relaxation and than another one introduced recently by Anjos and Wolkowicz [Discrete Appl. Math., to appear]. We also show how the Lovász–Schrijver relaxations for the stable set polytope of G can be strengthened using the corresponding relaxations for the cut polytope of the graph G ∇ obtained from G by adding a node adjacent to all nodes of G.
Semidefinite optimization approaches for satisfiability and maximumsatisfiability problems
 J. Satisf. Bool. Model. Comput
"... Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatorial problems in particular, semidefinite programming has had a truly significant impact. This paper surveys some of the res ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatorial problems in particular, semidefinite programming has had a truly significant impact. This paper surveys some of the results obtained in the application of semidefinite programming to satisfiability and maximumsatisfiability problems. The approaches presented in some detail include the groundbreaking approximation algorithm of Goemans and Williamson for MAX2SAT, the Gap relaxation of de Klerk, van Maaren and Warners, and strengthenings of the Gap relaxation based on the Lasserre hierarchy of semidefinite liftings for polynomial optimization problems. We include theoretical and computational comparisons of the aforementioned semidefinite relaxations for the special case of 3SAT, and conclude with a review of the most recent results in the application of semidefinite programming to SAT and MAXSAT.