Martin Grötschel, László Lovász  Home/Search
Context
Related
| rutgers.edu/techps/1993/9329.ps unipaderborn.de/f...bOptimcont.ps.gz unipaderborn.de/fac...CombOptim.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF Problem Downloading? From: dbai.tuwien.ac.at/staff/slany (more) From: unipaderborn.de/fachbe...scripts (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper is a chapter of the forthcoming Handbook of Combinatorics, to be published by North-Holland. It surveys the basic techniques and methods in combinatorial optimization. We organize our material according to the fundamental algorithmic techniques and illustrate them on problems to which these methods have been applied successfully. Special attention is given to approximation algorithms and fast (primal and dual) heuristics. (Update)
Active bibliography (related documents): More All
0.5: The Colin de Verdičre graph parameter - van der Holst, Lovász, Schrijver (1997) (Correct)
0.5: Oriented Matroids in Terms of Order Functions - Jaritz (1997) (Correct)
0.4: The Markov Chain Monte Carlo Method: An Approach To.. - Jerrum, Sinclair (1996) (Correct)
Similar documents based on text: More All
0.2: Lattice Basis Reduction and Integer Programming - Aardal (1999) (Correct)
0.2: When Does The Positive Semidefiniteness Constraint Help.. - Goemans, Tunçel (2000) (Correct)
0.2: Non-Standard Approaches to Integer Programming - Aardal, Weismantel, Wolsey (1999) (Correct)
BibTeX entry: (Update)
@misc{ tschel-combinatorial,
author = "Martin Grötschel and László Lovász",
title = "Combinatorial Optimization: A Survey",
url = "citeseer.ist.psu.edu/77239.html" }
Citations (may not include all citations):1527 Optimization by simulated annealing - Kirckpatrick, Gelatt et al. - 1983
643 Equation of state calculation by fast computing machines (context) - Metropolis, Rosenblut et al. - 1953
518 Integer and Combinatorial Optimization (context) - Nemhauser, Wolsey - 1988 ACM
371 Optimization by simulated annealing: an experimental evaluat.. (context) - Johnson, Aragon et al. - 1989
371 Optimization by simulated annealing: an experimental evaluat.. (context) - Johnson, Aragon et al. - 1991
348 Estimation of Dependences Based on Empirical Data (context) - Vapnik - 1982
333 Geometric Algorithms and Combinatorial Optimization (context) - Grotschel, Lov'asz et al. - 1988
303 Princeton University Press (context) - Ford, Fulkerson et al. - 1962
293 Approximation algorithms for combinatorial problems (context) - Johnson - 1974 ACM DBLP
218 Probabilistic construction of deterministic algorithms: Appr.. (context) - Raghavan - 1988 ACM DBLP
149 Fast probabilistic algorithms for verification of polynomial.. (context) - Schwartz - 1980 ACM DBLP
145 Random generation of combinatorial structures from a uniform.. (context) - Jerrum, Valiant et al. - 1986 DBLP
141 An Effective Heuristic Algorithm for the Traveling Salesman .. (context) - Lin, Kernigham - 1973
124 How to draw a graph (context) - Tutte - 1963
117 The ellipsoid method and its consequences in combinatorial o.. (context) - Grotschel, Lov'asz et al. - 1981
115 Approximating the permanent (context) - Jerrum, Sinclair - 1989
106 Group representations in probability and statistics (context) - Diaconis - 1988
106 Matching is as easy as matrix inversion (context) - Mulmuley, Vazirani et al. - 1987 ACM DBLP
96 Fast approximation algorithms for the knapsack and sum of su.. (context) - Ibarra, Kim - 1975 ACM DBLP
87 Approximation algorithms for scheduling unrelated parallel m.. (context) - Lenstra, Shmoys et al. - 1990 ACM DBLP
84 How easy is local search (context) - Johnson, Papadimitriou et al. - 1988
78 Fast algorithms for geometric traveling salesman problems (context) - Bentley - 1992
77 An approximation algorithm for the generalized assignment pr.. (context) - Shmoys, Tardos - 1993 ACM
56 Conductance and the rapid mixing property for Markov chains:.. (context) - Sinclair, Jerrum - 1988
53 An efficient approximation scheme for the onedimensional bin.. (context) - Karmarkar, Karp - 1982
52 Solving airline crew-scheduling problems by branchand -cut (context) - Hoffman, Padberg - 1992
50 A hierarchy of relaxations between the continuous and convex.. (context) - Sherali, Adams - 1990 DBLP
50 The algorithmic aspects of the Regularity Lemma - Alon, Duke et al. - 1992 ACM DBLP
46 Laplacian eigenvalues and the maximum cut problem (context) - Delorme, Poljak - 1990 ACM
42 Worst-case analysis of a new heuristic for the travelling sa.. (context) - Christofides - 1976
40 Theory of Integer and Linear Programming (context) - Schrijver - 1986
39 Graphes et Algorithmes (context) - Gondran, Minoux - 1979
36 An application of combinatorial optimization to statistical .. (context) - Barahona, Grotschel et al. - 1988 ACM
36 Resource constrained scheduling as generalized bin packing (context) - Garey, Graham et al. - 1976
34 A cutting plane algorithm for the linear ordering problem (context) - Grotschel, Junger et al. - 1984
33 the history of the minimum spanning tree problem (context) - Graham, Hell - 1985
32 Large cliques elude the Metropolis process (context) - Jerrum - 1992
29 Computing the volume of convex bodies: a case where randomne.. - Dyer, Frieze - 1992
29 Computational results with a cutting plane algorithm for des.. (context) - Grotschel, Monma et al. - 1992
28 Polyhedral Theory (context) - Grotschel, Padberg - 1985
27 Polyhedral computations (context) - Padberg, Grotschel - 1985
25 The time complexity of maximum matching by simulated anneali.. (context) - Sasaki, Hajek - 1988 ACM DBLP
25 Sampling and integration of near log-concave functions (context) - Applegate, Kannan - 1990 ACM DBLP
25 Handbooks in Operations Research and Management Science (context) - Nemhauser, Kan et al. - 1989
23 Network flow algorithms (context) - Goldberg, Tardos et al. - 1990
22 Properties of vertex packing and independence system polyhed.. (context) - Nemhauser, Trotter - 1974
22 Simple local search problems that are hard to solve (context) - Schaffer, Yannakakis - 1991
21 Cones of matrices and setfunctions (context) - Lov'asz, Schrijver - 1990
20 the cut polytope (context) - Barahona, Mahjoub - 1986
19 Solution of large-scale symmetric travelling salesman proble.. (context) - Grotschel, Holland - 1991
19 Systems of distinct representatives and linear algebra (context) - Edmonds
18 The travelling salesman problem and minimum spanning trees (context) - Held, Karp - 1970
15 Steepest descent can take exponential time for symmetric con.. (context) - Haken, Luby - 1988
13 An application of simultaneous Diophantine approximation in .. (context) - Frank, Tardos - 1987
13 the asymptotic complexity of matrix multiplication (context) - Coppersmith, Winograd - 1982
12 Send-and-split method for minimum concave-cost network flows (context) - Erickson, Monma et al. - 1987
12 algorithm for maximum matching in general graphs (context) - Even, Kariv - 1975
12 Combinatorial optimization with semi-definite matrices (context) - Alizadeh - 1992 DBLP
11 Discrete and Computational Geometry (context) - Haussler, Welzl et al. - 1987
8 Simulated annealing via Sobolev inequalities (context) - Holley, Stroock - 1988
8 Eigenvalues and the max-cut problem (context) - Mohar, Poljak - 1990
7 Packing Steiner trees: a cutting plane algorithm and computa.. - Grotschel, Martin et al. - 1992
7 An analysis for the greedy algorithm for independence system.. (context) - Korte, Hausmann - 1978
7 A cutting plane algorithm for a clustering problem (context) - Grotschel, Wakabayashi - 1989
5 rd IEEE FOCS (context) - Lov'asz, Simonovits et al. - 1992
5 The effect of the density of states on the Metropolis algori.. (context) - Sasaki - 1991 ACM DBLP
5 Two combinatorial covering theorems (context) - Stein - 1974
5 and graph connectivity (context) - Linial, Lov'asz et al. - 1988
4 Lov'asz and R (context) - Korte - 1991
4 A survey of the known facets of the cut cone (context) - Deza, Laurent - 1991
4 Finding largest convex subsets (context) - Chv'atal, Klincsek - 1980
4 An improved lower bound for on-line bin-packing algorithms (context) - van Vliet - 1992
4 Almost tight bounds on epsilon-nets (context) - Koml'os, Pach et al. - 1992
3 and random algorithms (context) - Lov'asz, matchings - 1979
3 Akad'emiai Kiad'o - North Holland (context) - Lov'asz, Plummer et al. - 1986
3 Handbooks in Operations Research and Management Science (context) - Junger, Reinelt et al. - 1994
2 Berlin--Heidelberg--New York (context) - Recski, Theory et al. - 1989
2 The Travelling Salesman Problem: a Guided Tour through Combi.. (context) - Lawler, Lenstra et al. - 1985
2 The Travelling Salesman Problem: a Guided Tour through Combi.. (context) - Lenstra, Kan - 1991
2 Orthogonal representations and connectivity of graphs (context) - Lov'asz, Saks et al. - 1989
1 A Random Polynomial Time Algorithm for Approximating the Vol.. (context) - Hayward, Dyer et al. - 1991 ACM DBLP
1 Integer linear programs for local maximum cuts (context) - Poljak - 1993
1 The factorisation of linear graphs (context) - Tutte - 1947
1 Mathematical Programming: the State of the Art (context) - Bachem, Grotschel et al. - 1983
1 the ratio of optimal fractional and integral covers (context) - Lov'asz - 1975
1 Optimum branchings: J (context) - Edmonds
1 Local optimization and the travelling salesman problem (context) - Sci, Johnson - 1990
1 Approximation algorithms for bin-packing --- and updated sur.. (context) - Coffman, Garey et al. - 1984
1 Cook and V (context) - Applegate, Bixby - 1993
1 Theoretical improvements in algorithmic efficiency for netwo.. (context) - Standards, -- et al. - 1972 ACM DBLP
1 Bin packing solved within (context) - de la, Lueker - 1981
1 Contributions to Practical Traveling Salesman Problem Solvin.. (context) - Reinelt - 1993
1 Near-optimal allocation algorithms (context) - Johnson - 1973
1 Asymptotics of the spectral gap with applications to the the.. (context) - Phys, Holley et al. - 1989
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC