Combinatorial Optimization

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Cluster Editing with Vertex Splitting
3. Altmetric Badge
   Chapter 2 Compact MILP Formulations for the p -Center Problem
4. Altmetric Badge
   Chapter 3 The Next Release Problem: Complexity, Exact Algorithms and Computations
5. Altmetric Badge
   Chapter 4 Polytope Membership in High Dimension
6. Altmetric Badge
   Chapter 5 Graph Orientation with Splits
7. Altmetric Badge
   Chapter 6 The Stop Number Minimization Problem: Complexity and Polyhedral Analysis
8. Altmetric Badge
   Chapter 7 Maximum Concurrent Flow with Incomplete Data
9. Altmetric Badge
   Chapter 8 Characterising Chordal Contact $$B_0$$ -VPG Graphs
10. Altmetric Badge
    Chapter 9 Approximating the Caro-Wei Bound for Independent Sets in Graph Streams
11. Altmetric Badge
    Chapter 10 The Minimum Rooted-Cycle Cover Problem
12. Altmetric Badge
    Chapter 11 Online Firefighting on Trees
13. Altmetric Badge
    Chapter 12 A Multigraph Formulation for the Generalized Minimum Spanning Tree Problem
14. Altmetric Badge
    Chapter 13 The Distance Polytope for the Vertex Coloring Problem
15. Altmetric Badge
    Chapter 14 A PTAS for the Time-Invariant Incremental Knapsack Problem
16. Altmetric Badge
    Chapter 15 On Bounded Pitch Inequalities for the Min-Knapsack Polytope
17. Altmetric Badge
    Chapter 16 Efficient Algorithms for Measuring the Funnel-Likeness of DAGs
18. Altmetric Badge
    Chapter 17 Jointly Optimizing Replica Placement, Requests Distribution and Server Storage Capacity on Content Distribution Networks
19. Altmetric Badge
    Chapter 18 An Exact Column Generation-Based Algorithm for Bi-objective Vehicle Routing Problems
20. Altmetric Badge
    Chapter 19 Multi-start Local Search Procedure for the Maximum Fire Risk Insured Capital Problem
21. Altmetric Badge
    Chapter 20 A Branch-and-Bound Procedure for the Robust Cyclic Job Shop Problem
22. Altmetric Badge
    Chapter 21 An Exact Algorithm for the Split-Demand One-Commodity Pickup-and-delivery Travelling Salesman Problem
23. Altmetric Badge
    Chapter 22 Descent with Mutations Applied to the Linear Ordering Problem
24. Altmetric Badge
    Chapter 23 Characterization and Approximation of Strong General Dual Feasible Functions
25. Altmetric Badge
    Chapter 24 Preemptively Guessing the Center
26. Altmetric Badge
    Chapter 25 Improved Algorithms for k -Domination and Total k -Domination in Proper Interval Graphs
27. Altmetric Badge
    Chapter 26 A Heuristic for Maximising Energy Efficiency in an OFDMA System Subject to QoS Constraints
28. Altmetric Badge
    Chapter 27 An Integer Programming Approach to the Student-Project Allocation Problem with Preferences over Projects
29. Altmetric Badge
    Chapter 28 Even Flying Cops Should Think Ahead
30. Altmetric Badge
    Chapter 29 A Generalization of the Minimum Branch Vertices Spanning Tree Problem
31. Altmetric Badge
    Chapter 30 A Polyhedral View to Generalized Multiple Domination and Limited Packing
32. Altmetric Badge
    Chapter 31 Alternating Current Optimal Power Flow with Generator Selection
33. Altmetric Badge
    Chapter 32 Parameterized Algorithms for Module Map Problems
34. Altmetric Badge
    Chapter 33 2 CSPs All Are Approximable Within a Constant Differential Factor
35. Altmetric Badge
    Chapter 34 Finding Minimum Stopping and Trapping Sets: An Integer Linear Programming Approach
36. Altmetric Badge
    Chapter 35 Lovász-Schrijver PSD-Operator on Some Graph Classes Defined by Clique Cutsets