• Home
  • Search
  • Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack
  • Open Access IconOpen Access
  • Cite Icon57
  • https://doi.org/10.1007/978-3-642-20807-2_24Copy DOI Icon

Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack

  • Jan 1, 2011
  • Anna R Karlin +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Abstract In this paper, we study the integrality gap of the Knapsack linear program in the Sherali-Adams and Lasserre hierarchies. First, we show that an integrality gap of 2 – ε persists up to a linear number of rounds of Sherali-Adams, despite the fact that Knapsack admits a fully polynomial time approximation scheme [24, 30]. Second, we show that the Lasserre hierarchy closes the gap quickly. Specifically, after t rounds of Lasserre, the integrality gap decreases to t/(t – 1). This answers the open question in [9]. Also, to the best of our knowledge, this is the first positive result that uses more than a small number of rounds in the Lasserre hierarchy. Our proof uses a decomposition theorem for the Lasserre hierarchy, which may be of independent interest.KeywordsConvex CombinationKnapsack ProblemVertex CoverIntegral SolutionValid InequalityThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Similar Papers
  • Research Article
  • Citations1

Strengths and Limitations of Linear Programming Relaxations

  • Jan 01, 2017
  • Infoscience (Ecole Polytechnique Fédérale de Lausanne)
  • Abbas Bazzi
  • Conference Article
  • Citations11

Definability of semidefinite programming and lasserre lower bounds for CSPs

  • Jun 01, 2017
  • Anuj Dawar +1
  • Research Article
  • Citations18

Limitations of Semidefinite Programs for Separable States and Entangled Games

  • Mar 01, 2019
  • Communications in Mathematical Physics
  • Aram W Harrow +2
  • Conference Article
  • Citations60

Approximating CSPs with Global Cardinality Constraints Using SDP Hierarchies

  • Jan 17, 2012
  • Prasad Raghavendra +1
  • Research Article
  • Citations3

Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps

  • Apr 06, 2021
  • Mathematics of Operations Research
  • Samuel C Gutekunst +1
  • Conference Article
  • Citations13

Train and test tightness of LP relaxations in structured prediction

  • Jun 19, 2016
  • Apollo (University of Cambridge)
  • Ofer Meshi +3
  • Research Article
  • Citations26

On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique

  • Jun 16, 2018
  • ACM Transactions on Algorithms
  • Samuel B Hopkins +4
  • Conference Article
  • Citations2

LP relaxations of some NP-hard problems are as hard as any LP

  • Jan 16, 2017
  • Daniel Průša +1
  • Book Chapter
  • Citations1

A $\frac{5}{4}$ -Approximation for Subcubic 2EC Using Circulations

  • Jan 01, 2014
  • Sylvia Boyd +2
  • Research Article
  • Citations16

Linear Programming-Based Converses for Finite Blocklength Lossy Joint Source-Channel Coding

  • Nov 01, 2017
  • IEEE Transactions on Information Theory
  • Sharu Theresa Jose +1
  • Research Article
  • Citations78

On linear and semidefinite programming relaxations for hypergraph matching

  • Apr 20, 2011
  • Mathematical Programming
  • Yuk Hei Chan +1
  • Research Article
  • Citations87

Tight Approximation Algorithms for Maximum Separable Assignment Problems

  • Aug 01, 2011
  • Mathematics of Operations Research
  • Lisa Fleischer +3
  • Research Article
  • Citations12

Data-driven optimal control with a relaxed linear program

  • Dec 02, 2021
  • Automatica
  • Andrea Martinelli +2
  • Research Article
  • Citations2

TWO APPLICATIONS OF COMBINATORIAL OPTIMIZATION

  • Jan 01, 2014
  • Matthew Oster
  • Research Article
  • Citations31

Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing

  • Jun 01, 1997
  • OR Spektrum
  • Hartmut Stadtler
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.