scientific article; zbMATH DE number 4197756

zbMATH Open0725.90075MaRDI QIDQ5202849FDOQ5202849

Authors: Narendra K. Karmarkar 

Publication date: 1990

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

NP-complete problemspotential functionKarmarkar's linear programming algorithmpathwise connected level setsquadratic optimization problems over polytopes

Mathematics Subject Classification ID

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

Cited In (10)

• A continuous approach to inductive inference
• Complexity, exactness, and rationality in polynomial optimization
• Complexity, exactness, and rationality in polynomial optimization
• Advances in trust region algorithms for constrained optimization
• An interior point algorithm to solve computationally difficult set covering problems
• A study on concave optimization via canonical dual function
• A potential reduction approach to the frequency assignment problem
• A branch bound method for subset sum problem
• Computation of a trust region step
• Potential reduction algorithms for structured combinatorial optimization problems

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)