scientific article; zbMATH DE number 4197756

MaRDI QIDQ5202849zbMATH OpenFDO

Authors Narendra K. Karmarkar

Publication date 1990

zbMATH Keywords

Karmarkar's linear programming algorithmNP-complete problemspathwise connected level setspotential functionquadratic optimization problems over polytopes

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Boolean programming (90C09) Integer programming (90C10) Quadratic programming (90C20) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A branch bound method for subset sum problem
• scientific article; zbMATH DE number 1302172
• A new polynomial-time algorithm for linear programming
• Some NP-complete problems in quadratic and nonlinear programming
• scientific article; zbMATH DE number 4197755

Cited in

(12)

• A study on concave optimization via canonical dual function
• An interior point algorithm to solve computationally difficult set covering problems
• Computation of a trust region step
• Advances in trust region algorithms for constrained optimization
• 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
• scientific article; zbMATH DE number 1302172 (Why is no real title available?)
• Complexity, exactness, and rationality in polynomial optimization
• Complexity, exactness, and rationality in polynomial optimization
• A continuous approach to inductive inference
• The mixed integer trust region problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202849)