scientific article; zbMATH DE number 4197756
From MaRDI portal
Publication:5202849
zbMath0725.90075MaRDI QIDQ5202849
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-complete problemspotential functionKarmarkar's linear programming algorithmpathwise connected level setsquadratic optimization problems over polytopes
Numerical mathematical programming methods (65K05) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (10)
A branch bound method for subset sum problem ⋮ Potential reduction algorithms for structured combinatorial optimization problems ⋮ A potential reduction approach to the frequency assignment problem ⋮ An interior point algorithm to solve computationally difficult set covering problems ⋮ Computation of a trust region step ⋮ A continuous approach to inductive inference ⋮ A study on concave optimization via canonical dual function ⋮ Complexity, exactness, and rationality in polynomial optimization ⋮ Complexity, exactness, and rationality in polynomial optimization ⋮ Advances in trust region algorithms for constrained optimization
This page was built for publication:
