Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
Nowadays, a large amount of information has to be transmitted or processed. This implies high-power processing, large memory… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Review
2018
Review
2018
Abstract The nitrides of most of the group IVb-Vb-VIb transition metals (TiN, ZrN, HfN, VN, NbN, TaN, MoN, WN) constitute the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
It is well-known that the integrality gap of the usual linear programming relaxation for Maxcut is 2 - ε. For general graphs, we… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
  • J. Tropp
  • Signal Process.
  • 2006
  • Corpus ID: 2478002
A simultaneous sparse approximation problem requests a good approximation of several input signals at once using different linear… Expand
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Abstract Fractional kinetic equations of the diffusion, diffusion–advection, and Fokker–Planck type are presented as a useful… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
Is this relevant?
Highly Cited
1986
Highly Cited
1986
The fundamental principles, basic mechanisms, and formal analyses involved in the development of parallel distributed processing… Expand
  • figure 1
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • table II
  • table III
Is this relevant?