Potential reduction algorithms for structured combinatorial optimization problems

DOI10.1016/S0167-6377(97)00031-XMaRDI QIDQ1373458zbMATH OpenOpenAlexWikidataFDO

Authors J. Ning

Publication date 16 August 1998

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-6377(97)00031-x

zbMATH Keywords

interior point methodsgraph coloring problemnonconvex quadratic optimizationpotential functionbinary programmingpotential reduction algorithmbinary feasibility problems

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27) Boolean programming (90C09)

Recommendations

• scientific article; zbMATH DE number 1047677
• A nonlinear approach to a class of combinatorial optimization problems
• Solving combinatorial optimization problems using Karmarkar's algorithm
• A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems
• A potential reduction algorithm for linearly constrained convex programming

Cites work

• scientific article; zbMATH DE number 1047679 (Why is no real title available?)
• scientific article; zbMATH DE number 194668 (Why is no real title available?)
• scientific article; zbMATH DE number 4197756 (Why is no real title available?)
• A nonlinear approach to a class of combinatorial optimization problems
• An interior point algorithm to solve computationally difficult set covering problems
• Computational experience with an interior point algorithm on the satisfiability problem
• Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
• Newton’s Method with a Model Trust Region Modification

Cited in

(1)

• A potential reduction approach to the frequency assignment problem

This page was built for publication: Potential reduction algorithms for structured combinatorial optimization problems

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