Combinatorial Optimization: 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020, Revised Selected Papers

Front Matter ....Pages i-xi
Front Matter ....Pages 1-1
 Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs  (Gabriela Argiroffo, Silvia Bianchi, Yanina Lucarini, Annegret Wagler)....Pages 3-14
 On the p-Median Polytope and the Directed Odd Cycle Inequalities  (Mourad Baïou, Francisco Barahona)....Pages 15-26
 On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs  (Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini)....Pages 27-41
 A Polyhedral Study for the Buy-at-Bulk Facility Location Problem  (Chaghoub Soraya, Ibrahima Diarrassouba)....Pages 42-53
 Cardinality Constrained Multilinear Sets  (Rui Chen, Sanjeeb Dash, Oktay Günlük)....Pages 54-65
 On the Multiple Steiner Traveling Salesman Problem with Order Constraints  (Raouia Taktak, Eduardo Uchoa)....Pages 66-77
Front Matter ....Pages 79-79
 On the Linear Relaxation of the \\(s-t\\)-cut Problem with Budget Constraints  (Hassene Aissi, A. Ridha Mahjoub)....Pages 81-88
 An Experimental Study of ILP Formulations for the Longest Induced Path Problem  (Fritz Bökler, Markus Chimani, Mirko H. Wagner, Tilo Wiedera)....Pages 89-101
 Handling Separable Non-convexities Using Disjunctive Cuts  (Claudia D’Ambrosio, Jon Lee, Daphne Skipper, Dimitri Thomopulos)....Pages 102-114
 Improving Proximity Bounds Using Sparsity  (Jon Lee, Joseph Paat, Ingo Stallknecht, Luze Xu)....Pages 115-127
 Cut and Flow Formulations for the Balanced Connected k-Partition Problem  (Flávio K. Miyazawa, Phablo F. S. Moura, Matheus J. Ota, Yoshiko Wakabayashi)....Pages 128-139
Front Matter ....Pages 141-141
 Polynomial Scheduling Algorithm for Parallel Applications on Hybrid Platforms  (Massinissa Ait Aba, Lilia Zaourar, Alix Munier)....Pages 143-155
 Anchored Rescheduling Problems Under Generalized Precedence Constraints  (Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau)....Pages 156-166
 Scheduling with Non-renewable Resources: Minimizing the Sum of Completion Times  (Kristóf Bérczi, Tamás Király, Simon Omlor)....Pages 167-178
 Arc-Flow Approach for Parallel Batch Processing Machine Scheduling with Non-identical Job Sizes  (Renan Spencer Trindade, Olinto C. B. de Araújo, Marcia Fampa)....Pages 179-190
Front Matter ....Pages 191-191
 Dynamic and Stochastic Rematching for Ridesharing Systems: Formulations and Reductions  (Gabriel Homsi, Bernard Gendron, Sanjay Dominik Jena)....Pages 193-201
 The Distance Matching Problem  (Péter Madarasi)....Pages 202-213
 Notes on Equitable Partitions into Matching Forests in Mixed Graphs and b-branchings in Digraphs  (Kenjiro Takazawa)....Pages 214-224
Front Matter ....Pages 225-225
 Quasi-Separable Dantzig-Wolfe Reformulations for Network Design  (Antonio Frangioni, Bernard Gendron, Enrico Gorgone)....Pages 227-236
 Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem  (Yuya Masumura, Taihei Oki, Yutaro Yamaguchi)....Pages 237-248
 On Finding Shortest Paths in Arc-Dependent Networks  (P. Wojciechowski, Matthew Williamson, K. Subramani)....Pages 249-260
Front Matter ....Pages 261-261
 The Knapsack Problem with Forfeits  (Raffaele Cerulli, Ciriaco D’Ambrosio, Andrea Raiconi, Gaetano Vitale)....Pages 263-272
 An Efficient Matheuristic for the Inventory Routing Problem  (Pedro Diniz, Rafael Martinelli, Marcus Poggi)....Pages 273-285
 Solving a Real-World Multi-attribute VRP Using a Primal-Based Approach  (Mayssoun Messaoudi, Issmail El Hallaoui, Louis-Martin Rousseau, Adil Tahir)....Pages 286-296
 Correction to: The Knapsack Problem with Forfeits  (Raffaele Cerulli, Ciriaco D’Ambrosio, Andrea Raiconi, Gaetano Vitale)....Pages C1-C1
Back Matter ....Pages 297-298