Conferences in DBLP

Combinatorial Optimization (Aussois) (aussois)
2001 (conf/aussois/2001)

1. 
   Surprise Session for Jack Edmonds, "Eureka - You Shrink!". [Citation Graph (0, 0)][DBLP]
   Combinatorial Optimization, 2001, pp:1-10 [Conf]
   
2. Jack Edmonds
   Submodular Functions, Matroids, and Certain Polyhedra. [Citation Graph (0, 0)][DBLP]
   Combinatorial Optimization, 2001, pp:11-26 [Conf]
   
3. Jack Edmonds, Ellis L. Johnson
   Matching: A Well-Solved Class of Integer Linear Programs. [Citation Graph (0, 0)][DBLP]
   Combinatorial Optimization, 2001, pp:27-30 [Conf]
   
4. Jack Edmonds, Richard M. Karp
   Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. [Citation Graph (0, 0)][DBLP]
   Combinatorial Optimization, 2001, pp:31-33 [Conf]
   
5. Kathie Cameron
   Connected Matchings. [Citation Graph (0, 0)][DBLP]
   Combinatorial Optimization, 2001, pp:34-38 [Conf]
   
6. Reinhardt Euler
   Hajós' Construction and Polytopes. [Citation Graph (0, 0)][DBLP]
   Combinatorial Optimization, 2001, pp:39-47 [Conf]
   
7. Robert T. Firla, Bianca Spille, Robert Weismantel
   Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection. [Citation Graph (0, 0)][DBLP]
   Combinatorial Optimization, 2001, pp:48-63 [Conf]
   
8. Matteo Fischetti, Andrea Lodi, Paolo Toth
   Solving Real-World ATSP Instances by Branch-and-Cut. [Citation Graph (0, 0)][DBLP]
   Combinatorial Optimization, 2001, pp:64-77 [Conf]
   
9. Gerald Gruber, Franz Rendl
   The Bundle Method for Hard Combinatorial Optimization Problems. [Citation Graph (0, 0)][DBLP]
   Combinatorial Optimization, 2001, pp:78-88 [Conf]
   
10. Hipólito Hernández-Pérez, Juan José Salazar González
    The One-Commodity Pickup-and-Delivery Travelling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorial Optimization, 2001, pp:89-104 [Conf]
    
11. Volker Kaibel
    Reconstructing a Simple Polytope from Its Graph. [Citation Graph (0, 0)][DBLP]
    Combinatorial Optimization, 2001, pp:105-118 [Conf]
    
12. Adam N. Letchford, Andrea Lodi
    An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming. [Citation Graph (0, 0)][DBLP]
    Combinatorial Optimization, 2001, pp:119-133 [Conf]
    
13. 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:134-146 [Conf]
    
14. Marcus Oswald, Gerhard Reinelt
    Constructing New Facets of the Consecutive Ones Polytope. [Citation Graph (0, 0)][DBLP]
    Combinatorial Optimization, 2001, pp:147-157 [Conf]
    
15. Jean-Philippe P. Richard, Ismael R. de Farias Jr., George L. Nemhauser
    A Simplex-Based Algorithm for 0-1 Mixed Integer Programming. [Citation Graph (0, 0)][DBLP]
    Combinatorial Optimization, 2001, pp:158-170 [Conf]
    
16. Rüdiger Schultz
    Mixed-Integer Value Functions in Stochastic Programming. [Citation Graph (0, 0)][DBLP]
    Combinatorial Optimization, 2001, pp:171-184 [Conf]
    
17. Gerhard J. Woeginger
    Exact Algorithms for NP-Hard Problems: A Survey. [Citation Graph (0, 0)][DBLP]
    Combinatorial Optimization, 2001, pp:185-208 [Conf]