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
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
A Monte Carlo analysis is presented which establishes a relationship between the rotational diffusion coefficients and the… 
Highly Cited
1979
Highly Cited
1979
The mechanism of β-adrenergic relaxation was investigated in isolated smooth muscle cells. β-adrenergic agents stimulate cyclic… 
Highly Cited
1979
Highly Cited
1979
A new model for the relaxation of a potential perturbation in dielectric materials is developed based on the correlated… 
Highly Cited
1978
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
1956
Highly Cited
1956
Theory of nuclear magnetic relaxation in antiferromagnetics treated in the preceding paper for non-magnetic ·ions is extended to…