Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- 1 December 1996
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 62 (1) , 253-276
- https://doi.org/10.1007/bf02206819
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- A cutting plane algorithm for convex programming that uses analytic centersMathematical Programming, 1995
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the ArtINFORMS Journal on Computing, 1994
- Solving the Steiner Tree Problem on a Graph Using Branch and CutINFORMS Journal on Computing, 1992
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear ProgrammingSIAM Journal on Optimization, 1992
- Solution of large-scale symmetric travelling salesman problemsMathematical Programming, 1991
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman ProblemsSIAM Review, 1991
- On Finding Primal- and Dual-Optimal BasesINFORMS Journal on Computing, 1991
- Solving matching problems with linear programmingMathematical Programming, 1985
- A Cutting Plane Algorithm for the Linear Ordering ProblemOperations Research, 1984
- Optimal triangulation of large real world input-output matricesStatistische Hefte, 1983