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
2011
Highly Cited
2011
We propose multigrid methods for solving Hamilton-Jacobi-Bellman (HJB) and HamiltonJacobi-Bellman-Isaacs (HJBI) equations. The… 
Highly Cited
2004
Highly Cited
2004
  • A. Donlin
  • 2004
  • Corpus ID: 848364
Transaction-level models (TLMs) address the problems of designing increasingly complex systems by raising the level of design… 
Highly Cited
1998
Highly Cited
1998
Abstract : Coherent nonlinear optical spectroscopy of individual excitons in GaAs quantum dots is demonstrated and shows strong… 
Highly Cited
1995
Highly Cited
1995
Artificial "neural networks" are widely used as flexible models for classification and regression applications, but questions… 
Highly Cited
1981
Highly Cited
1981
In this paper we report the results of model calculations of the nuclear potential surfaces of van der Waals complexes consisting… 
Highly Cited
1978
Highly Cited
1978
Summary. A systematic approach is suggested for modelling the development of sedimentary basins. The theory, which partitions… 
Highly Cited
1965
Highly Cited
1965
2014 The theory of interatomic collisions, in the sudden approximation, is generalised in order to calculate their influence on… 
Highly Cited
1961
Highly Cited
1961
Such phenomena as dielectric, magnetic, and anelastic relaxation are often described in terms of a distribution of relaxation…