Linear programming relaxation

Known as: LP relaxation, LP-relaxation 
In mathematics, the linear programming relaxation of a 0-1 integer program is the problem that arises by replacing the constraint that each variable… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach relies… (More)
Is this relevant?
2007
2007
  • Hongdong Li
  • IEEE Conference on Computer Vision and Pattern…
  • 2007
This paper studies the problem of multibody motion segmentation, which is an important, but challenging problem due to its well… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We propose a linear programming relaxation scheme for the class of multiple object tracking problems where the inter-object… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
A new method is given for performing approximate maximum-likelihood (ML) decoding of an arbitrary binary linear code based on… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We develop and analyze methods for computing provably optimal maximum a posteriori probability (MAP) configurations for a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods, i.e… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiability (MAX 2SAT) problems… (More)
  • figure 1
  • figure 2
  • table I
  • table II
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We consider the survivable network design problem the problem of designing, at minimum cost, a network with edge-connectivity… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
1990
Highly Cited
1990
In this paper a reformulation technique is presented that takes a given linear zero-one programming problem, converts it into a… (More)
Is this relevant?