↓ Skip to main content

Integer Programming and Combinatorial Optimization

Overview of attention for book
Cover of 'Integer Programming and Combinatorial Optimization'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
  3. Altmetric Badge
    Chapter 2 Metric Inequalities and the Network Loading Problem
  4. Altmetric Badge
    Chapter 3 Valid Inequalities Based on Simple Mixed-Integer Sets
  5. Altmetric Badge
    Chapter 4 The Price of Anarchy when Costs Are Non-separable and Asymmetric
  6. Altmetric Badge
    Chapter 5 Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem
  7. Altmetric Badge
    Chapter 6 Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games
  8. Altmetric Badge
    Chapter 7 A Robust Optimization Approach to Supply Chain Management
  9. Altmetric Badge
    Chapter 8 Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
  10. Altmetric Badge
    Chapter 9 Scheduling an Industrial Production Facility
  11. Altmetric Badge
    Chapter 10 Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs
  12. Altmetric Badge
    Chapter 11 A TDI Description of Restricted 2-Matching Polytopes
  13. Altmetric Badge
    Chapter 12 Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
  14. Altmetric Badge
    Chapter 13 Semi-continuous Cuts for Mixed-Integer Programming
  15. Altmetric Badge
    Chapter 14 Combinatorial Benders’ Cuts
  16. Altmetric Badge
    Chapter 15 A Faster Exact Separation Algorithm for Blossom Inequalities
  17. Altmetric Badge
    Chapter 16 LP-based Approximation Algorithms for Capacitated Facility Location
  18. Altmetric Badge
    Chapter 17 A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem
  19. Altmetric Badge
    Chapter 18 Separable Concave Optimization Approximately Equals Piecewise Linear Optimization
  20. Altmetric Badge
    Chapter 19 Three Kinds of Integer Programming Algorithms Based on Barvinok’s Rational Functions
  21. Altmetric Badge
    Chapter 20 The Path-Packing Structure of Graphs
  22. Altmetric Badge
    Chapter 21 More on a Binary-Encoded Coloring Formulation
  23. Altmetric Badge
    Chapter 22 Single Machine Scheduling with Precedence Constraints
  24. Altmetric Badge
    Chapter 23 The Constrained Minimum Weighted Sum of Job Completion Times Problem
  25. Altmetric Badge
    Chapter 24 Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption
  26. Altmetric Badge
    Chapter 25 A Flow-Based Method for Improving the Expansion or Conductance of Graph Cuts
  27. Altmetric Badge
    Chapter 26 All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables
  28. Altmetric Badge
    Chapter 27 A Capacity Scaling Algorithm for M-convex Submodular Flow
  29. Altmetric Badge
    Chapter 28 Integer Concave Cocirculations and Honeycombs
  30. Altmetric Badge
    Chapter 29 Minsquare Factors and Maxfix Covers of Graphs
  31. Altmetric Badge
    Chapter 30 Low-Dimensional Faces of Random 0/1-Polytopes
  32. Altmetric Badge
    Chapter 31 On Polyhedra Related to Even Factors
  33. Altmetric Badge
    Chapter 32 Optimizing over Semimetric Polytopes
Attention for Chapter 7: A Robust Optimization Approach to Supply Chain Management
Altmetric Badge

Mentioned by

wikipedia
2 Wikipedia pages

Citations

dimensions_citation
7 Dimensions

Readers on

mendeley
212 Mendeley
citeulike
2 CiteULike
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
A Robust Optimization Approach to Supply Chain Management
Chapter number 7
Book title
Integer Programming and Combinatorial Optimization
Published by
Springer, Berlin, Heidelberg, June 2004
DOI 10.1007/978-3-540-25960-2_7
Book ISBNs
978-3-54-022113-5, 978-3-54-025960-2
Authors

Dimitris Bertsimas, Aurélie Thiele, Bertsimas, Dimitris, Thiele, Aurélie

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 2 <1%
Chile 1 <1%
Austria 1 <1%
Czechia 1 <1%
Mexico 1 <1%
France 1 <1%
Korea, Republic of 1 <1%
China 1 <1%
Spain 1 <1%
Other 1 <1%
Unknown 201 95%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 42 20%
Student > Master 18 8%
Lecturer 12 6%
Professor > Associate Professor 11 5%
Student > Bachelor 11 5%
Other 40 19%
Unknown 78 37%
Readers by discipline Count As %
Business, Management and Accounting 35 17%
Engineering 30 14%
Mathematics 29 14%
Decision Sciences 8 4%
Computer Science 5 2%
Other 17 8%
Unknown 88 42%