Integer programming and combinatorial optimization

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Colourful linear programming
3. Altmetric Badge
   Chapter 2 Test sets and inequalities for integer programs
4. Altmetric Badge
   Chapter 3 An optimal, stable continued fraction algorithm for arbitrary dimension
5. Altmetric Badge
   Chapter 4 Algorithms and extended formulations for one and two facility network design
6. Altmetric Badge
   Chapter 5 Integer multicommodity flow problems
7. Altmetric Badge
   Chapter 6 A heuristic algorithm for the set covering problem
8. Altmetric Badge
   Chapter 7 An ε-Relaxation method for generalized separable convex cost network flow problems
9. Altmetric Badge
   Chapter 8 Finding real-valued single-source shortest paths in o ( n 3 ) expected time
10. Altmetric Badge
    Chapter 9 A network-flow technique for finding low-weight bounded-degree spanning trees
11. Altmetric Badge
    Chapter 10 Approximating k -set cover and complementary graph coloring
12. Altmetric Badge
    Chapter 11 On minimum 3-cuts and approximating k-cuts using Cut Trees
13. Altmetric Badge
    Chapter 12 Primal-dual approximation algorithms for feedback problems in planar graphs
14. Altmetric Badge
    Chapter 13 Cone-LP's and semidefinite programs: Geometry and a simplex-type method
15. Altmetric Badge
    Chapter 14 Integer Programming and Combinatorial Optimization
16. Altmetric Badge
    Chapter 15 A semidefinite bound for mixing rates of Markov chains
17. Altmetric Badge
    Chapter 16 The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases
18. Altmetric Badge
    Chapter 17 On optimizing multiplications of sparse matrices
19. Altmetric Badge
    Chapter 18 Continuous relaxations for Constrained Maximum-Entropy Sampling
20. Altmetric Badge
    Chapter 19 A submodular optimization problem with side constraints
21. Altmetric Badge
    Chapter 20 Convexity and Steinitz's exchange property
22. Altmetric Badge
    Chapter 21 On ideal clutters, metrics and multiflows
23. Altmetric Badge
    Chapter 22 A supermodular relaxation for scheduling with release dates
24. Altmetric Badge
    Chapter 23 Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
25. Altmetric Badge
    Chapter 24 Implementation of a linear time algorithm for certain generalized traveling salesman problems
26. Altmetric Badge
    Chapter 25 On dependent randomized rounding algorithms
27. Altmetric Badge
    Chapter 26 Coloring bipartite hypergraphs
28. Altmetric Badge
    Chapter 27 Improved randomized approximation algorithms for lot-sizing problems
29. Altmetric Badge
    Chapter 28 Minimizing total completion time in a two-machine flowshop: Analysis of special cases
30. Altmetric Badge
    Chapter 29 A new approach to computing optimal schedules for the job-shop scheduling problem
31. Altmetric Badge
    Chapter 30 Optimal on-line algorithms for single-machine scheduling
32. Altmetric Badge
    Chapter 31 The strongest facets of the acyclic subgraph polytope are unknown
33. Altmetric Badge
    Chapter 32 Transitive packing
34. Altmetric Badge
    Chapter 33 A polyhedral approach to the feedback vertex set problem
35. Altmetric Badge
    Chapter 34 Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time
36. Altmetric Badge
    Chapter 35 Separating maximally violated comb inequalities in planar graphs
37. Altmetric Badge
    Chapter 36 The travelling salesman and the PQ-tree