Interior Point Methods for Combinatorial Optimization
- 1 January 1998
- book chapter
- other
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 77 references indexed in Scilit:
- Exact ground states of two-dimensional ±J Ising spin glassesJournal of Statistical Physics, 1996
- Gomory cuts revisitedOperations Research Letters, 1996
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial OptimizationSIAM Journal on Optimization, 1995
- A lift-and-project cutting plane algorithm for mixed 0–1 programsMathematical Programming, 1993
- Facets for the cut cone II: Clique-web inequalitiesMathematical Programming, 1992
- Facets for the cut cone IMathematical Programming, 1992
- Data Structures and Programming Techniques for the Implementation of Karmarkar's AlgorithmINFORMS Journal on Computing, 1989
- An implementation of Karmarkar's algorithm for linear programmingMathematical Programming, 1989
- A variation on Karmarkar’s algorithm for solving linear programming problemsMathematical Programming, 1986
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960