Combinatorial Optimization

Combinatorial Optimization (1993)

Cached

Download Links

[ftp.zib.de]

Other Repositories/Bibliography

DBLP

by M. Grötschel , L. Lovász

Citations:

19 - 1 self

BibTeX

@MISC{Grötschel93combinatorialoptimization,
    author = {M. Grötschel and L. Lovász},
    title = {Combinatorial Optimization},
    year = {1993}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

2801	Optimization by simulated annealing - Kirkpatrick, Gelatt, et al. - 1983
1644	Equation of state calculation by fast computing machines - Metropolis, AN, et al. - 1953
969	Geometric Algorithms and Combinatorial Optimization - Grötschel, Lovász, et al. - 1993
622	Flows in Networks - Ford, Fulkerson - 1962
577	Approximation algorithms for combinatorial problems - Johnson - 1974
446	Optimization by simulated annealing: an experimental evaluation� part ii, graph coloring and number partioning - Johnson, Aragon, et al. - 1991
324	Fast Probabilistic Algorithms for Verification of Polynomial Identities - Schwartz - 1980
314	How to draw a graph - Tutte - 1962
284	The ellipsoid method and its consequences in combinatorial optimization - GRÖTSCHEL, LOVÁSZ, et al. - 1981
281	Theoretical improvements in algorithmic efficiency for network flow problems - Edmonds, Karp - 1970
259	Probabilistic construction of deterministic algorithms: approximating packing integer programs - RAGHAVAN - 1988
257	Approximating the Permanent - Jerrum, Sinclair - 1989
246	Group representations in Probability and Statistics - Diaconis - 1988
240	Epsilon-nets and simplex range queries - Haussler, Welzl - 1987
233	Geometric bounds for eigenvalues of Markov chains,” The Annals of Applied Probability - Diaconis, Stroock - 1991
221	Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem - Christofides - 1976
211	Cones of matrices and set-functions and 0 , 1 optimization - Lovasz, Schrijver - 1991
169	How easy is local search - Johnson, Papadimitriou, et al. - 1988
158	C.E.Kim, Fast approximation algorithms for the knapsack and sum of subset problems - Ibarra - 1975
141	The Traveling Salesman Problem and Minimum Spanning Trees - Held, Karp - 2005
140	Matching is as easy as matrix inversion - Mulmuley, Vazirani, et al. - 1987
137	A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems - Sherali, Adams - 1990
136	Optimum Branchings - Edmonds - 1967
135	Local optimization and the traveling salesman problem - Johnson - 1990
130	A random polynomial time algorithm for approximating the volume of a convex body - Dyer, Frieze, et al. - 1991
128	An approximation algorithm for the generalized assignment problem - Shmoys, Tardos - 1993
122	Fast algorithms for geometric traveling salesman problems - Bentley - 1992
112	Solving airline crew-scheduling problems by branchand -cut, Mgmt - Hoffman, Padberg - 1993
104	TSPLIB - A Traveling Salesman Problem - Reinelt - 1991
100	An efficient approximation scheme for the one-dimensional bin-packing problem - Karmarkar, Karp - 1982
96	On the cut polytope - Barahona, Mahjoub - 1986
88	Approximation algorithms for bin packing { an updated survey - Coman, Garey, et al. - 1984
82	Conductance and the rapid mixing property for markov chains: the approximation of permanent resolved - Jerrum, Sinclair - 1988
77	Matching Theory. Akadémiai Kiadó - Lovász, Plummer - 1986
73	Simple local search problems that are hard to solve - Schäffer, Yannakakis - 1991
70	A Cutting Plane Algorithm for the Linear Ordering Problem - Grötschel, Jünger, et al. - 1984
69	Sampling and Integration of Near Log-Concave functions, STOC - Applegate, Kannan - 1991
56	Computational results with a cutting plane algorithm for designing communication networks with lowconnectivity constraints - Grötschel, Monma, et al. - 1992
52	Computing the volume of convex bodies: A case where randomness provably helps - Dyer, Frieze - 1991
50	An application of combinatorial optimization to statistical physics and circuit layout design - Barahona, Grötschel, et al. - 1988
49	Resource Constrained Scheduling as Generalized Bin Packing - Garey, Graham, et al. - 1976
48	Laplacian eigenvalues and the maximum cut problem - Delorme, Poljak - 1990
43	Solution of large-scale symmetric travelling salesman problems - Grötschel, Holland - 1991
42	Large cliques elude the metropolis process, Random Structures and Algorithms - Jerrum - 1992
42	The time complexity of maximum matching by simulated annealing - Sasaki, Hajek - 1988
38	On determinants, matchings and random algorithms - Lovász
34	A.: Rubber bands, convex embeddings and graph connectivity. Combinatorica 8(1 - Linial, Lovász, et al. - 1988
33	Polyhedral theory - Grötschel, Padberg - 1985
28	Yuster The algorithmic aspects of the Regularity - Alon, Duke, et al. - 1994
28	On the randomized complexity of volume and diameter - Lov'asz, Simonovits - 1992