Potential reduction algorithms for structured combinatorial optimization problems
From MaRDI portal
Publication:1373458
DOI10.1016/S0167-6377(97)00031-XzbMath0893.90131MaRDI QIDQ1373458
Publication date: 16 August 1998
Published in: Operations Research Letters (Search for Journal in Brave)
interior point methods; potential function; graph coloring problem; nonconvex quadratic optimization; binary programming; potential reduction algorithm; binary feasibility problems
Related Items
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