Computational Experience with an Interior Point Cutting Plane Algorithm
- 1 January 2000
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 10 (4) , 1212-1227
- https://doi.org/10.1137/s1052623497324242
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Path optimization for graph partitioning problemsDiscrete Applied Mathematics, 1999
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problemsEuropean Journal of Operational Research, 1997
- HOPDM (version 2.12) — A fast LP solver based on a primal-dual interior point methodEuropean Journal of Operational Research, 1995
- On the Implementation of a Primal-Dual Interior Point MethodSIAM Journal on Optimization, 1992
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman ProblemsSIAM Review, 1991
- A cutting plane algorithm for a clustering problemMathematical Programming, 1989
- Experiments in quadratic 0–1 programmingMathematical Programming, 1989
- The Evolution of the Minimum Degree Ordering AlgorithmSIAM Review, 1989
- Optimal triangulation of large real world input-output matricesStatistische Hefte, 1983
- Yale sparse matrix package I: The symmetric codesInternational Journal for Numerical Methods in Engineering, 1982