
Conferences in DBLP
Surprise Session for Jack Edmonds, "Eureka  You Shrink!". [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:110 [Conf]
 Jack Edmonds
Submodular Functions, Matroids, and Certain Polyhedra. [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:1126 [Conf]
 Jack Edmonds, Ellis L. Johnson
Matching: A WellSolved Class of Integer Linear Programs. [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:2730 [Conf]
 Jack Edmonds, Richard M. Karp
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:3133 [Conf]
 Kathie Cameron
Connected Matchings. [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:3438 [Conf]
 Reinhardt Euler
Hajós' Construction and Polytopes. [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:3947 [Conf]
 Robert T. Firla, Bianca Spille, Robert Weismantel
Algorithmic Characterization of Bipartite bMatching and Matroid Intersection. [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:4863 [Conf]
 Matteo Fischetti, Andrea Lodi, Paolo Toth
Solving RealWorld ATSP Instances by BranchandCut. [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:6477 [Conf]
 Gerald Gruber, Franz Rendl
The Bundle Method for Hard Combinatorial Optimization Problems. [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:7888 [Conf]
 Hipólito HernándezPérez, Juan José Salazar González
The OneCommodity PickupandDelivery Travelling Salesman Problem. [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:89104 [Conf]
 Volker Kaibel
Reconstructing a Simple Polytope from Its Graph. [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:105118 [Conf]
 Adam N. Letchford, Andrea Lodi
An AugmentandBranchandCut Framework for Mixed 01 Programming. [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:119133 [Conf]
 Jean François Maurras, Viet Hung Nguyen
A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope. [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:134146 [Conf]
 Marcus Oswald, Gerhard Reinelt
Constructing New Facets of the Consecutive Ones Polytope. [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:147157 [Conf]
 JeanPhilippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser
A SimplexBased Algorithm for 01 Mixed Integer Programming. [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:158170 [Conf]
 Rüdiger Schultz
MixedInteger Value Functions in Stochastic Programming. [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:171184 [Conf]
 Gerhard J. Woeginger
Exact Algorithms for NPHard Problems: A Survey. [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:185208 [Conf]
