Integer Programming and Combinatorial Optimization

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 37 Improved approximation algorithms for MAX k -CUT and MAX BISECTION
3. Altmetric Badge
   Chapter 38 Approximating minimum feedback sets and multi-cuts in directed graphs
4. Altmetric Badge
   Chapter 39 Nonlinear formulations and improved randomized approximation algorithms for multicut problems
5. Altmetric Badge
   Chapter 40 Separating clique tree and bipartition inequalities in polynomial time
6. Altmetric Badge
   Chapter 41 The interval order polytope of a digraph
7. Altmetric Badge
   Chapter 42 Separation problems for the stable set polytope
8. Altmetric Badge
   Chapter 43 Computational study of a family of mixed-integer quadratic programming problems
9. Altmetric Badge
   Chapter 44 A minimal algorithm for the Bounded Knapsack Problem
10. Altmetric Badge
    Chapter 45 A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems
11. Altmetric Badge
    Chapter 46 Combining semidefinite and polyhedral relaxations for integer programs
12. Altmetric Badge
    Chapter 47 Distributed near-optimal matching
13. Altmetric Badge
    Chapter 48 The random linear bottleneck assignment problem
14. Altmetric Badge
    Chapter 49 On implementing push-relabel method for the maximum flow problem
15. Altmetric Badge
    Chapter 50 Use of hidden network structure in the set partitioning problem
16. Altmetric Badge
    Chapter 51 Generalized max flows and augmenting paths
17. Altmetric Badge
    Chapter 52 Oriented matroid polytopes and polyhedral fans are signable
18. Altmetric Badge
    Chapter 53 On combinatorial properties of binary spaces
19. Altmetric Badge
    Chapter 54 Coverings and delta-coverings
20. Altmetric Badge
    Chapter 55 The topological structure of maximal lattice free convex bodies: The general case
21. Altmetric Badge
    Chapter 56 The Hilbert basis of the cut cone over the complete graph K 6
22. Altmetric Badge
    Chapter 57 GRIN: An implementation of Gröbner bases for integer programming
23. Altmetric Badge
    Chapter 58 Scheduling jobs of equal length: Complexity, facets and computational results
24. Altmetric Badge
    Chapter 59 Formulating a scheduling problem with almost identical jobs by using positional completion times
25. Altmetric Badge
    Chapter 60 Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
26. Altmetric Badge
    Chapter 61 A mickey-mouse decomposition theorem
27. Altmetric Badge
    Chapter 62 Minimum cost dynamic flows: The series-parallel case
28. Altmetric Badge
    Chapter 63 (0, ±1) ideal matrices
29. Altmetric Badge
    Chapter 64 Embedding graphs in the torus in linear time
30. Altmetric Badge
    Chapter 65 A characterization of Seymour graphs
31. Altmetric Badge
    Chapter 66 The Markov chain of colourings
32. Altmetric Badge
    Chapter 67 Packing algorithms for arborescences (and spanning trees) in capacitated graphs
33. Altmetric Badge
    Chapter 68 A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem
34. Altmetric Badge
    Chapter 69 How to make a strongly connected digraph two-connected
35. Altmetric Badge
    Chapter 70 Polyhedra and optimization in connection with a weak majorization ordering
36. Altmetric Badge
    Chapter 71 Combining and strengthening Gomory cuts
37. Altmetric Badge
    Chapter 72 Sequence independent lifting of cover inequalities