↓ Skip to main content
What is this page? Embed badge

Combinatorial Optimization — Eureka, You Shrink!

Overview of attention for book
Cover of 'Combinatorial Optimization — Eureka, You Shrink!'

Table of Contents

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

Readers on

mendeley
1 Mendeley
Summary
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Reconstructing a Simple Polytope from Its Graph
Chapter number 11
Book title
Combinatorial Optimization — Eureka, You Shrink!
Published by
Springer, Berlin, Heidelberg, January 2003
DOI 10.1007/3-540-36478-1_11
Book ISBNs
978-3-54-000580-3, 978-3-54-036478-8
Authors

Volker Kaibel, Kaibel, Volker

View on publisher site
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 1 100%
Lecturer > Senior Lecturer 1 100%
Readers by discipline Count As %
Mathematics 1 100%
Computer Science 1 100%

This page is provided by Altmetric.