Karen Aardal, Stan van Hoesel  Home/Search
Context Related
| cs.uu.nl/people/aardal/survey1.ps cs.uu.nl/pub/RUU/CS/tec...199529.ps.gz cs.uu.nl/~aardal/survey1.ps Cached: 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.
PS.gz PS Image Update HelpFrom: cs.uu.nl/people/aardal/ (more) From: cs.uu.nl/docs/researc...TechList1 (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Combinatorial optimization problems appear in many disciplines ranging from management and logistics to mathematics, physics, and chemistry. These problems are usually relatively easy to formulate mathematically, but most of them are computationally hard due to the restriction that a subset of the variables have to take integral values. During the last two decades there has been a remarkable progress in techniques based on the polyhedral description of combinatorial problems, leading to a large ... (Update)
Similar documents based on text: More All
1.8: Polyhedral Techniques in Combinatorial Optimization I: Theory - Aardal, van Hoesel (1995) (Correct)
1.1: Polyhedral Techniques in Combinatorial Optimization II.. - Aardal, van Hoesel (1995) (Correct)
0.5: Capacitated Facility Location: Separation Algorithms and.. - Aardal (1995) (Correct)
BibTeX entry: (Update)
K. Aardal and S. van Hoesel, "Polyhedral Techniques in Combinatorial Optimization," to appear in Statistica Neerlandica, 1995. http://citeseer.ist.psu.edu/article/aardal95polyhedral.html More
@misc{ aardal95polyhedral,
author = "K. Aardal and S. van Hoesel",
title = "Polyhedral Techniques in Combinatorial Optimization",
text = "K. Aardal and S. van Hoesel, Polyhedral Techniques in Combinatorial Optimization,
to appear in Statistica Neerlandica, 1995.",
year = "1995",
url = "citeseer.ist.psu.edu/article/aardal95polyhedral.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-co.. (context) - Garey, Johnson - 1979
717 Theory of Linear and Integer Programming (context) - Schrijver - 1986
518 Integer and Combinatorial Optimization (context) - Nemhauser, Wolsey - 1988
100 Integer programming with a fixed number of variables (context) - Lenstra - 1983
79 Solving large-scale zero-one linear programming problems (context) - Crowder, Johnson et al. - 1983
66 Decomposition of regular matroids (context) - Seymour - 1980
59 the complexity of cutting-plane proofs (context) - Cook, Coullard et al. - 1987
48 Solution of a large-scale traveling-salesman problem (context) - Dantzig, Fulkerson et al. - 1954
45 The ellipsoid method and its consequences in combinatorial o.. (context) - otschel, Lov'asz et al. - 1981
44 Outline of an algorithm for integer solutions to linear prog.. (context) - Gomory - 1958
42 A min-max relation for submodular functions on graphs (context) - Edmonds, Giles - 1977
42 Edmonds polytopes and a hierarchy of combinatorial problems (context) - Chv'atal - 1973
34 Facets of the knapsack polytope (context) - Balas - 1975
32 An algorithm for integer solutions to linear programs (context) - Gomory - 1963
27 Total dual integrality and integer polyhedra (context) - Giles, Pulleyblank - 1979
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.uu.nl/people/aardal/): More
Lattice Basis Reduction and Integer Programming - Aardal (1999) (Correct)
Reformulation of Capacitated Facility Location Problems: How.. - Aardal (1996) (Correct)
Polyhedral Techniques in Combinatorial Optimization II.. - Aardal, van Hoesel (1995) (Correct)
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