ABSTRACT. In this paper, we review recent interior point approaches for solving combinatorial optimization problems. We discuss in detail tecniques for linear and network programming, branch and bound and branch and cut methods, nonconvex potential function minimization, lower bounding techniques, and semidefinite programming relaxations. 1.
|
782
|
Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics 2. SpringerVerlag
– Grötschel, Lovász, et al.
- 1988
|
|
778
|
A computing procedure for quantification theory
– Davis, Putnam
- 1960
|
|
731
|
Integer and Combinatorial Optimization
– Nemhauser, Wolsey
- 1988
|
|
574
|
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
– Goemans, Williamson
- 1995
|
|
504
|
Data structures and network algorithms
– Tarjan
- 1983
|
|
483
|
Flows in networks
– Ford, Fulkerson
- 1962
|
|
457
|
A new polynomial-time algorithm for linear programming
– Karmarkar
- 1984
|
|
422
|
Semidefinite Programming
– Vandenberghe, Boyd
- 1996
|
|
405
|
Interior point methods in semidefinite programming with applications to combinatorial optimization
– Alizadeh
- 1995
|
|
364
|
Network Flows
– Ahuja, Magnanti, et al.
- 1993
|
|
320
|
Shortest connection networks and some generalizations
– Prim
- 1957
|
|
259
|
A polynomial algorithm in linear programming
– Khachiyan
- 1979
|
|
259
|
Primal-Dual Interior-Point Methods
– WRIGHT
- 1997
|
|
242
|
An algorithm for least-squares estimation of nonlinear parameters
– Marquardt
- 1963
|
|
230
|
Nonlinear programming: Sequential Unconstrained Minimization Techniques
– Fiacco, McCormick
- 1990
|
|
227
|
Combinatorial Optimization: Networks and
– Lawler
- 1976
|
|
221
|
On the Shannon capacity of a graph
– Lov'asz
- 1979
|
|
195
|
Maximum matching and polyhedron with 0, 1-vertices
– Edmonds
- 1965
|
|
185
|
Interior point polynomial methods in convex programming: Theory and algorithms
– Nesterov, Nemirovsky
- 1993
|
|
177
|
An interior-point method for semidefinite programming
– HELMBERG, RENDL, et al.
- 1996
|
|
175
|
On the implementation of a (primal-dual) interior point method
– Mehrotra
- 1992
|
|
157
|
A lift-and-project cutting plane algorithm for mixed 0-1 programs
– Balas, Ceria, et al.
- 1993
|
|
135
|
Computing a trust region step
– More, Sorensen
- 1983
|
|
134
|
Self-scaled barriers and interiorpoint methods for convex programming
– NESTEROV, TODD
- 1997
|
|
130
|
Interior path following primal-dual algorithms
– Monteiro, Adler
- 1989
|
|
129
|
Interior point methods for the monotone semidefinite linear complementarity problem in symmetric matrices
– Kojima, Shindoh, et al.
- 1994
|
|
128
|
An algorithm for integer solutions to linear programs
– Gomory
- 1963
|
|
122
|
Interior Point Algorithms. Theory and Analysis
– YE
- 1997
|
|
119
|
Linear Programming and Network Flows
– Bazaraa, Jarvis
- 1977
|
|
117
|
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems
– Padberg, Rinaldi
- 1991
|
|
110
|
Interior point methods for linear programming: Computational state of the art
– Lustig, Marsten, et al.
- 1994
|
|
103
|
A new algorithm for minimizing convex functions over convex sets
– Vaidya
- 1996
|
|
89
|
Iterative solutions of problems of linear and quadratic programming
– Dikin
- 1967
|
|
82
|
Solving large-scale sparse semidefinite programs for combinatorial optimization
– Benson, Ye, et al.
|
|
79
|
A greedy randomized adaptive search procedure for the quadratic assignment problem”, Quadratic assignment and related problems
– Li, Pardalos, et al.
- 1994
|
|
76
|
a C library for semidefinite programming
– CSDP
- 1999
|
|
73
|
A spectral bundle method for semidefinite programming
– HELMBERG, RENDL
- 2000
|
|
69
|
L-shaped linear programs with applications to optimal control and stochastic programming
– SLYKE, WETS
- 1969
|
|
65
|
A cutting plane algorithm for the linear ordering problem
– Grotschel, Junger, et al.
- 1984
|
|
60
|
Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
– FUJISAWA, KOJIMA, et al.
- 1997
|
|
60
|
Theory and Algorithms for Linear Optimization: An Interior Point Approach
– Vial
- 1997
|
|
59
|
Linear Programming: Foundations and Extensions
– Vanderbei
- 1997
|
|
58
|
A method for the solution of certain problems in least squares
– Levenberg
- 1944
|
|
58
|
Discrete Optimization
– Parker, Rardin
- 1988
|
|
55
|
A variation on Karmarkar’s algorithm for solving linear programming problems
– Barnes
- 1986
|
|
53
|
Implementation of interior point methods for large scale linear programming', Interior Point Methods
– Andersen, Gondzio, et al.
- 1996
|
|
53
|
Algorithms for network programming
– Kennington, Helgason
- 1980
|
|
52
|
Decomposition and nondifferentiable optimization with the projective algorithm
– Goffin, Haurie, et al.
- 1992
|
|
52
|
Semidefinite programming relaxations for the quadratic assignment problem
– ZHAO, KARISCH, et al.
- 1998
|
|
49
|
A modification of Karmarkar's linear programming algorithm", Algorithmica 1
– Vanderbei, Meketon, et al.
- 1986
|
|
