|
28
|
Computational experience with an interior pointcutting plane algorithm
– John E. Mitchell
- 1999
|
|
20
|
Solving Linear Ordering Problems With A Combined Interior Point/simplex Cutting Plane Algorithm
– John E. Mitchell, Brian Borchers
- 1997
|
|
18
|
Solving Real-World Linear Ordering Problems . . .
– John E. Mitchell, Brian Borchers
- 1995
|
|
12
|
Solving nonlinear multicommodity network flow problems by the analytic center cutting plane method
– J-L Goffin, J Gondzio, R Sarkissian, J-P Vial
- 1997
|
|
52
|
Solving combinatorial optimization problems using Karmarkar’s algorithm
– J E Mitchell, M J Todd
- 1992
|
|
133
|
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems
– M Padberg, G Rinaldi
- 1991
|
|
15
|
Using an Interior Point Method in a Branch and Bound Algorithm for Integer Programming.
– Brian Borchers, John E. Mitchell
- 1992
|
|
7
|
Interior point algorithms for integer programming
– John E. Mitchell
- 1996
|
|
125
|
On the Solution of Traveling Salesman Problems
– David Applegate, Robert Bixby, Vasek Chvatal, William Cook
- 1998
|
|
26
|
Karmarkar's Algorithm and Combinatorial Optimization Problems
– John E. Mitchell
- 1988
|
|
34
|
A Study of Indicators for Identifying Zero Variables in Interior Point Methods
– A S El-Bakry, R A Tapia, Y Zhang
- 1994
|
|
38
|
Convex Nondifferentiable Optimization: A Survey Focussed On The Analytic Center Cutting Plane Method.
– Jean-louis Goffin, Jean-Philippe Vial
- 1999
|
|
58
|
Mixed 0-1 Programming by Lift-andProject in a Branch-and-Cut Framework, Management Science 42
– E Balas, S Ceria, G Cornu'ejols
- 1996
|
|
99
|
Solving large-scale zero-one linear programming problems
– H Crowder, E L Johnson, M W Padberg
- 1983
|
|
9
|
Logarithmic Barrier Decomposition Methods for Semi-Infinite Programming
– J. Kaliski, D. Haglin, C. Roos, T. Terlaky
- 1996
|
|
47
|
A Cutting Plane Method from Analytic Centers for Stochastic Programming
– O. Bahn, O. du Merle, J.-L. Goffin, J. -p. Vial
- 1994
|
|
39
|
Complexity analysis of an interior cutting plane for convex feasibility problems
– J-L Goffin, Z-Q Luo, Y Ye
- 1996
|
|
10
|
J.E.: Cutting plane methods for semidefinite programming
– K Krishnan, Mitchell
|
|
9
|
A long-step, cutting plane algorithm for linear and convex programming
– J E Mitchell, S Ramaswamy
- 1993
|