Combinatorial optimization -- Eureka, you shrink. Papers dedicated to Jack Edmonds. 5th international workshop, Aussois, France, March 5--9, 2001. Revised papers (Q1394736)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Combinatorial optimization -- Eureka, you shrink. Papers dedicated to Jack Edmonds. 5th international workshop, Aussois, France, March 5--9, 2001. Revised papers |
scientific article; zbMATH DE number 1933859
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial optimization -- Eureka, you shrink. Papers dedicated to Jack Edmonds. 5th international workshop, Aussois, France, March 5--9, 2001. Revised papers |
scientific article; zbMATH DE number 1933859 |
Statements
Combinatorial optimization -- Eureka, you shrink. Papers dedicated to Jack Edmonds. 5th international workshop, Aussois, France, March 5--9, 2001. Revised papers (English)
0 references
24 June 2003
0 references
The articles of this volume will be reviewed individually. Indexed articles: ``Eureka -- you shrink!'' Surprise session for Jack Edmonds, 1-10 [Zbl 1024.01513] \textit{Edmonds, Jack}, Submodular functions, matroids, and certain polyhedra, 11-26 [Zbl 1024.90054] \textit{Edmonds, Jack; Johnson, Ellis L.}, Matching: A well-solved class of integer linear programs, 27-30 [Zbl 1024.90505] \textit{Edmonds, Jack; Karp, Richard M.}, Theoretical improvements in algorithmic efficiency for network flow problems, 31-33 [Zbl 1024.90511] \textit{Cameron, Kathie}, Connected matchings, 34-38 [Zbl 1024.05501] \textit{Euler, Reinhardt}, Hajós' construction and polytopes, 39-47 [Zbl 1024.90512] \textit{Firla, Robert T.; Spille, Bianca; Weismantel, Robert}, Algorithmic characterization of bipartite \(\mathfrak b\)-matching and matroid intersection, 48-63 [Zbl 1024.90055] \textit{Fischetti, Matteo; Lodi, Andrea; Toth, Paolo}, Solving real-world ATSP instances by branch-and-cut, 64-77 [Zbl 1024.90056] \textit{Gruber, Gerald; Rendl, Franz}, The bundle method for hard combinatorial optimization problems, 78-88 [Zbl 1024.90509] \textit{Hernández-Pérez, Hipólito; Salazar-González, Juan-José}, The one-commodity pickup-and-delivery travelling salesman problem, 89-104 [Zbl 1024.90057] \textit{Kaibel, Volker}, Reconstructing a simple polytope from its graph, 105-118 [Zbl 1024.90069] \textit{Letchford, Adam N.; Lodi, Andrea}, An augment-and-branch-and-cut framework for mixed 0-1 programming, 119-133 [Zbl 1024.90506] \textit{Maurras, Jean François; Nguyen, Viet Hung}, A procedure of facet composition for the symmetric traveling salesman polytope, 134-146 [Zbl 1024.90058] \textit{Oswald, Marcus; Reinelt, Gerhard}, Constructing new facets of the consecutive ones polytope, 147-157 [Zbl 1024.90059] \textit{Richard, Jean-Philippe P.; de Farias, Ismael R.; Nemhauser, George L.}, A simplex-based algorithm for 0-1 mixed integer programming, 158-170 [Zbl 1024.90507] \textit{Schultz, Rüdiger}, Mixed-integer value functions in stochastic programming, 171-184 [Zbl 1024.90051] \textit{Woeginger, Gerhard J.}, Exact algorithms for NP-hard problems: A survey, 185-207 [Zbl 1024.68529]
0 references
Combinatorial optimization
0 references
Aussois (France)
0 references