Sign in
Combinatorial Optimization
1993
1996
2000
2003
1993
2003
Keyphrases
Publications
volume 2570, 2003
Combinatorial Optimization - Eureka, You Shrink!, Papers Dedicated to Jack Edmonds, 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers
Combinatorial Optimization
2570 (2003)
2001
Adam N. Letchford
,
Andrea Lodi
An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming.
Combinatorial Optimization
(2001)
Gerhard J. Woeginger
Exact Algorithms for NP-Hard Problems: A Survey.
Combinatorial Optimization
(2001)
Jack R. Edmonds
,
Richard M. Karp
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.
Combinatorial Optimization
(2001)
Jean-Philippe P. Richard
,
Ismael R. de Farias Jr.
,
George L. Nemhauser
A Simplex-Based Algorithm for 0-1 Mixed Integer Programming.
Combinatorial Optimization
(2001)
Jean François Maurras
,
Viet Hung Nguyen
A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope.
Combinatorial Optimization
(2001)
Kathie Cameron
Connected Matchings.
Combinatorial Optimization
(2001)
Gerald Gruber
,
Franz Rendl
The Bundle Method for Hard Combinatorial Optimization Problems.
Combinatorial Optimization
(2001)
Hipólito Hernández-Pérez
,
Juan José Salazar González
The One-Commodity Pickup-and-Delivery Travelling Salesman Problem.
Combinatorial Optimization
(2001)
Matteo Fischetti
,
Andrea Lodi
,
Paolo Toth
Solving Real-World ATSP Instances by Branch-and-Cut.
Combinatorial Optimization
(2001)
Surprise Session for Jack Edmonds, "Eureka - You Shrink!".
Combinatorial Optimization
(2001)
Rüdiger Schultz
Mixed-Integer Value Functions in Stochastic Programming.
Combinatorial Optimization
(2001)
Reinhardt Euler
Hajós' Construction and Polytopes.
Combinatorial Optimization
(2001)
Marcus Oswald
,
Gerhard Reinelt
Constructing New Facets of the Consecutive Ones Polytope.
Combinatorial Optimization
(2001)
Jack R. Edmonds
Submodular Functions, Matroids, and Certain Polyhedra.
Combinatorial Optimization
(2001)
Jack R. Edmonds
,
Ellis L. Johnson
Matching: A Well-Solved Class of Integer Linear Programs.
Combinatorial Optimization
(2001)
Robert T. Firla
,
Bianca Spille
,
Robert Weismantel
Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection.
Combinatorial Optimization
(2001)
Volker Kaibel
Reconstructing a Simple Polytope from Its Graph.
Combinatorial Optimization
(2001)
volume 20, 1995
Combinatorial Optimization, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, 1992/93
Combinatorial Optimization
20 (1995)
1993
Yves Pochet
,
Laurence A. Wolsey
Algorithms and reformulations for lot sizing problems.
Combinatorial Optimization
(1993)
Preface.
Combinatorial Optimization
(1993)
Gábor Simonyi
Graph entropy: A survey.
Combinatorial Optimization
(1993)
László Lovász
Randomized algorithms in combinatorial optimization.
Combinatorial Optimization
(1993)
Michael Jünger
,
Gerhard Reinelt
,
Stefan Thienel
Practical problem solving with cutting plane algorithms in combinatorialoptimization.
Combinatorial Optimization
(1993)
Heike Ripphausen-Lipa
,
Dorothea Wagner
,
Karsten Weihe
Efficient algorithms for disjoint paths in planar graphs.
Combinatorial Optimization
(1993)
Svatopluk Poljak
,
Zsolt Tuza
Maximum cuts and largest bipartite subgraphs.
Combinatorial Optimization
(1993)
Michel Deza
,
Viatcheslav P. Grishukhin
,
Monique Laurent
Hypermetrics in geometry of numbers.
Combinatorial Optimization
(1993)
Forward.
Combinatorial Optimization
(1993)
David B. Shmoys
Computing near-optimal solutions to combinatorial optimization problems.
Combinatorial Optimization
(1993)