Potential reduction algorithms for structured combinatorial optimization problems

DOI10.1016/S0167-6377(97)00031-XzbMath0893.90131OpenAlexW1974010255WikidataQ127098627 ScholiaQ127098627MaRDI QIDQ1373458

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 methodspotential functiongraph coloring problemnonconvex quadratic optimizationbinary programmingpotential reduction algorithmbinary feasibility problems

Mathematics Subject Classification ID

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

Related Items

A potential reduction approach to the frequency assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational experience with an interior point algorithm on the satisfiability problem
• An interior point algorithm to solve computationally difficult set covering problems
• Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
• Newton’s Method with a Model Trust Region Modification
• A nonlinear approach to a class of combinatorial optimization problems