Computational experience with an interior pointcutting plane algorithm

Computational experience with an interior pointcutting plane algorithm (1999)

Cached

Download Links

by John E. Mitchell

Citations:

BibTeX

@MISC{Mitchell99computationalexperience,
    author = {John E. Mitchell},
    title = {Computational experience with an interior pointcutting plane algorithm},
    year = {1999}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

1117	Reducability Among Combinatorial Problems - Karp - 1972
969	Geometric Algorithms and Combinatorial Optimization - Grötschel, Lovász, et al. - 1993
224	On the implementation of a primal-dual interior point method - Mehrotra - 1992
133	A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems - Padberg, Rinaldi - 1991
125	On the solution of traveling salesman problems - Applegate, Bixby, et al. - 1998
114	Interior-Point Methods for Linear Programming - Lustig, Marsten, et al. - 1994
107	The evolution of minimum degree ordering algorithm - George, Liu - 1989
96	On the cut polytope - Barahona, Mahjoub - 1986
70	A Cutting Plane Algorithm for the Linear Ordering Problem - Grötschel, Jünger, et al. - 1984
52	Solving combinatorial optimization problems using Karmarkar’s algorithm - Mitchell, Todd - 1992
50	An application of combinatorial optimization to statistical physics and circuit layout design - Barahona, Grötschel, et al. - 1988
31	The Linear Ordering Problem: Algorithms and Applications - Reinelt - 1985
26	Karmakar’s algorithm and combinatorial optimization problems - Mitchell - 1988
25	Yale sparse matrix package I: The symmetric codes - Eisenstat, Gursky, et al. - 1982
23	Multiple cuts in the analytic center cutting plane methods - Goffin, Vial
22	Facets for the cut cone I - Deza, Laurent - 1992
21	Exact ground states of Ising spin glasses: New experimental results with a branch and cut algorithm - Simone, Diehl, et al. - 1995
21	Warm start of the primal-dual method applied in the cutting plane scheme - Gondzio - 1996
21	A cutting plane algorithm for a clustering problem - Grotschel, Wakabayashi - 1989
20	Practical problem solving with cutting plane algorithms - Jünger, Reinelt, et al. - 1995
20	Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm - Mitchell, Borchers - 1997
18	Solving realworld linear ordering problems using a primal-dual interior point cutting plane method’, Annals of Operations Research 62 - Mitchell, Borchers - 1996
13	Interior point methods for combinatorial optimization - Mitchell, Pardalos, et al. - 1998
11	On updating the analytic center after the addition of multiple cuts - Ramaswamy, Mitchell - 1218
11	G.: Experiments in quadratic 0-1 programming - Barahona, Junger, et al. - 1989
11	Path optimization for graph partitioning problems - Berry, Goldberg - 1999
10	Solution of large-scale travelling salesman problems - Grötschel, Holland - 1991
10	An interior point cutting plane algorithm for Ising spin glass problems - Mitchell - 1998
9	Polyhedral Combinatorics and the Acyclic Subdigraph Problem - Jünger - 1985
8	Exact ground states of two-dimensional ±J Ising spin glasses - Simone, Diehl, et al. - 1996
8	Facets for the cut cone II: Clique-web inequalities - Deza, Laurent - 1992
8	Optimal triangulation of large real-world inputoutput matrices - Grötschel, Jünger, et al. - 1984
8	Computational experience of an interior point SQP algorithm in a parallel branch-and-bound framework - Lee, Mitchell - 1997
8	Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems - Mitchell - 1997
7	Facets of the linear ordering polytope - Jiinger, Reinelt
5	PCx User’s Guide (Version 1.1 - Czyzyk, Mehrotra, et al. - 1997
4	The critical exponents of the two-dimensional Ising spin glass revisited: Exact ground state calculations and Monte Carlo simulations - Rieger, Santen, et al.
3	Algorithmic Aspects of Using Small Instance Relaxations in Parallel Branch-and-Cut - Christof, Reinelt
2	A branch-and-bound approach using polyhedral results for a clustering problem - Palubeckis - 1997
2	Branch and cut algorithms - Caprara, Fischetti - 1997
1	Path optimization for graph partitioning problems. Discrete Applied Mathematics - Berry, Goldberg - 1999
1	Private communication: Project of - Borchers - 1996
1	HOPDM (ver 2.12) — A fast LP solver based on a primal-dual interior point method - Gondzio - 1995
1	The critical exponents of the two-dimensional Ising spin glass revisited: Exact ground state calculations and Monte Carlo simulations - communication - 1995