A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming

Mathematics of Operations Research - United States
doi 10.1287/moor.28.3.470.16391
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász-Schrijver Procedures

2009English

Cuts for Mixed 0-1 Conic Programming

Mathematical Programming, Series B
MathematicsSoftware
2005English

The Power of Semidefinite Programming Relaxations for MAX-SAT

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1993English

Semidefinite Programming Relaxations Through Quadratic Reformulation for Box-Constrained Polynomial Optimization Problems

2019English

Mixed 0-1 Programming by Lift-And-Project in a Branch-And-Cut Framework

Management Science
Management ScienceManagementOperations ResearchStrategy
1996English

Mixed 0-1 Programming Through Benders' Partitioning Procedures and Genetic Algorithms

Journal of Japan Society for Fuzzy Theory and Systems
1998English

On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy