Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
What Is It, and What For?.- Examples.- Integer Programming and LP Relaxation.- Theory of Linear Programming: First Steps.- The… 
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… 
Highly Cited
2005
Highly Cited
2005
We develop and analyze methods for computing provably optimal maximum a posteriori probability (MAP) configurations for a… 
Review
2004
Review
2004
  • M. Fisher
  • Management Sciences
  • 2004
  • Corpus ID: 1227951
(This article originally appeared in Management Science, January 1981, Volume 27, Number 1, pp. 1-18, published by The Institute… 
Highly Cited
2000
Highly Cited
2000
We develop a mathematical programming approach for the classicalPSPACE-hard restless bandit problem in stochastic optimization… 
Highly Cited
1998
Highly Cited
1998
Semidefinite programming (SDP) relaxations for the quadratic assignment problem (QAP) are derived using the dual of the… 
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… 
Highly Cited
1986
Highly Cited
1986
The fundamental principles, basic mechanisms, and formal analyses involved in the development of parallel distributed processing… 
Highly Cited
1981
Highly Cited
1981
exchange and correlation, are not. We present two related methods for the self-interaction correction (SIC) of any density…