Combinatorial optimization - Eureka, you shrink ! : papers dedicated to Jack Edmonds : 5th international workshop, Aussois, France, March 5 9, 2001 : revised papers

Combinatorial optimization - Eureka, you shrink ! : papers dedicated to Jack Edmonds : 5th international workshop, Aussois, France, March 5 9, 2001 : revised papers

Enregistré dans:
Détails bibliographiques
Collectivité auteur: International workshop on combinatorial optimization :Aussois, France
Autres auteurs: Junger, Michael (Directeur de la publication), Reinelt, Gerhard (Directeur de la publication), Rinaldi, Giovanni (Directeur de la publication)
Format: Livre numérique
Langue:Anglais
Publié: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Collection:Lecture notes in computer science 2570
Sujets:
Informatique
Optimisation combinatoire
Algorithmes
Analyse numérique
Analyse combinatoire
Mélanges et hommages
Actes de congrès
Accès en ligne:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Note: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Variante du titre:Mélanges :, Edmonds., 1933-....
Edition sous un autre format:• Combinatorial optimization, Eureka, you shrink!, papers dedicated to Jack Edmonds, 5th international workshop, Aussois, France, March 5-9, 2001, revised papers, Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi (eds.), Berlin, Springer, 2003, 1 vol. (X-207 p.), Lecture notes in computer science, 3-540-00580-3
• Combinatorial Optimization -- Eureka, You Shrink!, Texte imprimé, 9783662196991
Table des matières:
  • 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.

Documents similaires