Combinatorial Optimization

Front Matter ....Pages I-XXI
 Cluster Editing with Vertex Splitting  (Faisal N. Abu-Khzam, Judith Egan, Serge Gaspers, Alexis Shaw, Peter Shaw)....Pages 1-13
 Compact MILP Formulations for the p-Center Problem  (Zacharie Ales, Sourour Elloumi)....Pages 14-25
 The Next Release Problem: Complexity, Exact Algorithms and Computations  (José Carlos Almeida Jr., Felipe de C. Pereira, Marina V. A. Reis, Breno Piva)....Pages 26-38
 Polytope Membership in High Dimension  (Evangelos Anagnostopoulos, Ioannis Z. Emiris, Vissarion Fisikopoulos)....Pages 39-51
 Graph Orientation with Splits  (Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono)....Pages 52-63
 The Stop Number Minimization Problem: Complexity and Polyhedral Analysis  (Mourad Baïou, Rafael Colares, Hervé Kerivin)....Pages 64-76
 Maximum Concurrent Flow with Incomplete Data  (Pierre-Olivier Bauguion, Claudia D’Ambrosio, Leo Liberti)....Pages 77-88
 Characterising Chordal Contact \\(B_0\\)-VPG Graphs  (Flavia Bonomo, María Pía Mazzoleni, Mariano Leonardo Rean, Bernard Ries)....Pages 89-100
 Approximating the Caro-Wei Bound for Independent Sets in Graph Streams  (Graham Cormode, Jacques Dark, Christian Konrad)....Pages 101-114
 The Minimum Rooted-Cycle Cover Problem  (D. Cornaz, Y. Magnouche)....Pages 115-120
 Online Firefighting on Trees  (Pierre Coupechoux, Marc Demange, David Ellison, Bertrand Jouve)....Pages 121-132
 A Multigraph Formulation for the Generalized Minimum Spanning Tree Problem  (Ernando Gomes de Sousa, Rafael Castro de Andrade, Andréa Cynthia Santos)....Pages 133-143
 The Distance Polytope for the Vertex Coloring Problem  (Bruno Dias, Rosiane de Freitas, Nelson Maculan, Javier Marenco)....Pages 144-156
 A PTAS for the Time-Invariant Incremental Knapsack Problem  (Yuri Faenza, Igor Malinovic)....Pages 157-169
 On Bounded Pitch Inequalities for the Min-Knapsack Polytope  (Yuri Faenza, Igor Malinović, Monaldo Mastrolilli, Ola Svensson)....Pages 170-182
 Efficient Algorithms for Measuring the Funnel-Likeness of DAGs  (Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge)....Pages 183-195
 Jointly Optimizing Replica Placement, Requests Distribution and Server Storage Capacity on Content Distribution Networks  (Raquel Gerhardt, Tiago Neves, Luis Rangel)....Pages 196-207
 An Exact Column Generation-Based Algorithm for Bi-objective Vehicle Routing Problems  (Estèle Glize, Nicolas Jozefowiez, Sandra Ulrich Ngueveu)....Pages 208-218
 Multi-start Local Search Procedure for the Maximum Fire Risk Insured Capital Problem  (Maria Isabel Gomes, Lourdes B. Afonso, Nelson Chibeles-Martins, Joana M. Fradinho)....Pages 219-227
 A Branch-and-Bound Procedure for the Robust Cyclic Job Shop Problem  (Idir Hamaz, Laurent Houssin, Sonia Cafieri)....Pages 228-240
 An Exact Algorithm for the Split-Demand One-Commodity Pickup-and-delivery Travelling Salesman Problem  (Hipólito Hernández-Pérez, Juan José Salazar-González)....Pages 241-252
 Descent with Mutations Applied to the Linear Ordering Problem  (Olivier Hudry)....Pages 253-264
 Characterization and Approximation of Strong General Dual Feasible Functions  (Matthias Köppe, Jiawei Wang)....Pages 265-276
 Preemptively Guessing the Center  (Christian Konrad, Tigran Tonoyan)....Pages 277-289
 Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs  (Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Maria Inés Lopez Pujato, Martin Milanič)....Pages 290-302
 A Heuristic for Maximising Energy Efficiency in an OFDMA System Subject to QoS Constraints  (Adam N. Letchford, Qiang Ni, Zhaoyu Zhong)....Pages 303-312
 An Integer Programming Approach to the Student-Project Allocation Problem with Preferences over Projects  (David Manlove, Duncan Milne, Sofiat Olaosebikan)....Pages 313-325
 Even Flying Cops Should Think Ahead  (Anders Martinsson, Florian Meier, Patrick Schnider, Angelika Steger)....Pages 326-337
 A Generalization of the Minimum Branch Vertices Spanning Tree Problem  (Massinissa Merabet, Jitamitra Desai, Miklos Molnar)....Pages 338-351
 A Polyhedral View to Generalized Multiple Domination and Limited Packing  (José Neto)....Pages 352-363
 Alternating Current Optimal Power Flow with Generator Selection  (Esteban Salgado, Andrea Scozzari, Fabio Tardella, Leo Liberti)....Pages 364-375
 Parameterized Algorithms for Module Map Problems  (Frank Sommer, Christian Komusiewicz)....Pages 376-388
 2 CSPs All Are Approximable Within a Constant Differential Factor  (Jean-François Culus, Sophie Toulouse)....Pages 389-401
 Finding Minimum Stopping and Trapping Sets: An Integer Linear Programming Approach  (Alvaro Velasquez, K. Subramani, Steven L. Drager)....Pages 402-415
 Lovász-Schrijver PSD-Operator on Some Graph Classes Defined by Clique Cutsets  (Annegret Wagler)....Pages 416-427
Back Matter ....Pages 429-430