Potential reduction algorithms for structured combinatorial optimization problems

DOI10.1016/S0167-6377(97)00031-XzbMATH Open0893.90131OpenAlexW1974010255WikidataQ127098627 ScholiaQ127098627MaRDI QIDQ1373458FDOQ1373458

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

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

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)

Cites Work

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

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)