Combinatorial Optimization — Eureka, You Shrink! [electronic resource] : Papers Dedicated to Jack Edmonds 5th International Workshop Aussois, France, March 5–9, 2001 Revised Papers /

“Eureka — You Skrink!” -- “Eureka — You Shrink!” -- Submodular Functions, Matroids, and Certain Polyhedra -- Matching: A Well-Solved Class of Integer Linear Programs -- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems -- Connected Matchings -- Hajós’ Construction and Polytopes -- Algorithmic Characterization of Bipartite b-Matching and Matroid Intersection -- Solving Real-World ATSP Instances by Branch-and-Cut -- The Bundle Method for Hard Combinatorial Optimization Problems -- The One-Commodity Pickup-and-Delivery Travelling Salesman Problem -- Reconstructing a Simple Polytope from Its Graph -- An Augment-and-Branch-and-Cut Framework for Mixed 0-1 Programming -- A Procedure of Facet Composition for the Symmetric Traveling Salesman Polytope -- Constructing New Facets of the Consecutive Ones Polytope -- A Simplex-Based Algorithm for 0-1 Mixed Integer Programming -- Mixed-Integer Value Functions in Stochastic Programming -- Exact Algorithms for NP-Hard Problems: A Survey.

Saved in:
Bibliographic Details
Main Authors: Jünger, Michael. editor., Reinelt, Gerhard. editor., Rinaldi, Giovanni. editor., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2003
Subjects:Mathematics., Algorithms., Numerical analysis., Computer science, Computer graphics., Probabilities., Probability Theory and Stochastic Processes., Discrete Mathematics in Computer Science., Algorithm Analysis and Problem Complexity., Numeric Computing., Computer Graphics.,
Online Access:http://dx.doi.org/10.1007/3-540-36478-1
Tags: Add Tag
No Tags, Be the first to tag this record!