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)
Context of citations to this paper: More
...been solved using a mixture of cutting plane algorithms and branch and bound. For recent surveys we refer to Aardal and Van Hoesel [1] [2], and to Chapter 3 of [22] Similar developments have been attained for column generation methods, which can be viewed as dual to cutting...
...which is computationally easy, but gives the same solution as optimizing over X . As discussed in Part I of this article (Aardal and Van Hoesel (1996)) it is hard in general to describe the convex hull of X by concise families of inequalities even if we allow for classes...
Cited by: More
Periodic Polyhedra - Meister (2004) (Correct)
Algorithms for the Radio Link Frequency Assignment Problem - Aardal, Hurkens.. (1999) (Correct)
Polyhedral Techniques in Combinatorial Optimization II.. - Aardal, van Hoesel (1995) (Correct)
Similar documents (at the sentence level):
55.0%: Polyhedral Techniques in Combinatorial Optimization - Aardal, van Hoesel (1995) (Correct)
Active bibliography (related documents): More All
1.8: Polyhedral Techniques in Combinatorial Optimization II.. - Aardal, van Hoesel (1995) (Correct)
0.9: Worst-case Comparison of Valid Inequalities for the TSP - Goemans (1995) (Correct)
0.6: On the Separation of Maximally Violated mod-k Cuts - Caprara, Fischetti, Letchford (1998) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
1.8: Polyhedral Techniques in Combinatorial Optimization I: Theory - Aardal, van Hoesel (1995) (Correct)
0.5: Capacitated Facility Location: Separation Algorithms and.. - Aardal (1995) (Correct)
0.4: Reformulation of Capacitated Facility Location Problems: How.. - Aardal (1996) (Correct)
Related documents from co-citation: More All
4: Local Search in Combinatorial Optimization (context) - Aarts, Lenstra - 1997
4: The traveling salesman problem and minimum spanning trees: Part II (context) - Held, Karp - 1971
4: The generalized basis reduction algorithm (context) - Lov'asz, Scarf - 1992
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
27 On certain polytopes associated with graphs (context) - Chv'atal - 1975
27 Polyhedral computations (context) - Padberg, otschel - 1985
26 Finding cuts in the TSP (context) - Applegate, Bixby et al. - 1994
21 Solving linear programming problems in integers (context) - Gomory - 1960
20 On linear characterizations of combinatorial optimization pr.. (context) - Karp, Papadimitriou - 1980
20 the two-level uncapacitated facility location problem - Aardal, Labb'e et al. - 1994
20 Maximum matching and a polyhedron with 0,1-vertices (context) - Edmonds - 1965
19 Gomory cuts revisited - Balas, Ceria et al. - 1994
17 Uncapacitated lot-sizing: the convex hull of solutions (context) - Barany, Van Roy et al. - 1984
16 Matrices with the Edmonds-Johnson property (context) - Gerards, Schrijver - 1986
15 Sensitivity theorems in integer linear programming (context) - Cook, Gerards et al. - 1986
14 Worst-case comparison of valid inequalities for the TSP - Goemans - 1993
13 Capacitated facility location: valid inequalities and facets (context) - Aardal, Pochet et al. - 1993
13 Solving large-scale symmetric traveling salesman problems to.. (context) - Crowder, Padberg - 1980
11 Facets of regular 0-1 polytopes (context) - Hammer, Johnson et al. - 1975
11 A branch-andcut algorithm for the frequency assignment probl.. (context) - Aardal, Hipolito et al. - 1995
10 On cutting planes (context) - Schrijver - 1980
10 Capacitated facility location: separation algorithms and com.. - Aardal - 1994
7 Solution of large-scale symmetric traveling salesman problem.. (context) - otschel, Holland - 1991
7 Faces for a linear inequality in 0-1 variables (context) - Wolsey - 1975
6 A cutting plane algorithm for the single-machine scheduling .. (context) - Nemhauser, Savelsbergh - 1992
5 A time-indexed formulation of single-machine scheduling prob.. (context) - van den Akker, van Hoesel et al. - 1993
5 the symmetric traveling salesman problem: solution of a 120 .. (context) - otschel - 1980
5 A timeindexed formulation of single-machine scheduling probl.. (context) - van den Akker, Hurkens et al. - 1995
4 Economic lotsizing: an O(n log n) algorithm that runs in lin.. (context) - Wagelmans, van Hoesel et al. - 1992
3 1; k)-configurations and facets for packing problems (context) - Padberg - 1980
3 Functional description of MINTO, a Mixed INTeger Optimizer - Savelsbergh, Sigismondi et al. - 1994
3 A linear description of the discrete lot sizing and scheduli.. (context) - van Hoesel, Kolen - 1994
3 Uncapacitated facility location: lifting, separation and com.. (context) - Aardal, van Hoesel - 1995
2 Characterization of the graphs with all subgraphs t-perfect (context) - Gerards, Shepherd - 1995
2 the symmetric traveling salesman problem I: inequalities (context) - otschel, Padberg - 1979
2 Clique tree inequalities and the symmetric traveling salesma.. (context) - otschel, Pulleyblank - 1986
1 Linear description of the discrete lot sizing problem with W.. (context) - van Eijl, van Hoesel - 1995
1 A class of valid inequalities for the discrete lot sizing an.. (context) - van Hoesel, Kolen - 1995
1 Scheduling jobs of equal length: complexity, facets and comp.. - Crama, Spieksma - 1995
1 An extension of Konings's theorem to graphs with no odd-K 4 (context) - Gerards - 1989
1 Economic lot sizing with start-up costs: the convex hull (context) - van Hoesel, Wagelmans et al. - 1994
1 Sequence independent lifting of cover inequalities (context) - Gu, Nemhauser et al. - 1995
1 On total dual integrality (context) - Schrijver - 1981
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