- Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau:
Anchored Rescheduling Problems Under Generalized Precedence Constraints. ISCO 2020: 156-166 - Kristóf Bérczi, Tamás Király, Simon Omlor:
Scheduling with Non-renewable Resources: Minimizing the Sum of Completion Times. ISCO 2020: 167-178 - Fritz Bökler, Markus Chimani, Mirko H. Wagner, Tilo Wiedera:
An Experimental Study of ILP Formulations for the Longest Induced Path Problem. ISCO 2020: 89-101 - Raffaele Cerulli, Ciriaco D'Ambrosio, Andrea Raiconi, Gaetano Vitale:
The Knapsack Problem with Forfeits. ISCO 2020: 263-272 - Rui Chen, Sanjeeb Dash, Oktay Günlük:
Cardinality Constrained Multilinear Sets. ISCO 2020: 54-65 - Claudia D'Ambrosio, Jon Lee, Daphne E. Skipper, Dimitri Thomopulos:
Handling Separable Non-convexities Using Disjunctive Cuts. ISCO 2020: 102-114 - Pedro Diniz, Rafael Martinelli, Marcus Poggi:
An Efficient Matheuristic for the Inventory Routing Problem. ISCO 2020: 273-285 - Antonio Frangioni, Bernard Gendron, Enrico Gorgone:
Quasi-Separable Dantzig-Wolfe Reformulations for Network Design. ISCO 2020: 227-236 - Gabriel Homsi, Bernard Gendron, Sanjay Dominik Jena:
Dynamic and Stochastic Rematching for Ridesharing Systems: Formulations and Reductions. ISCO 2020: 193-201 - Jon Lee, Joseph Paat, Ingo Stallknecht, Luze Xu:
Improving Proximity Bounds Using Sparsity. ISCO 2020: 115-127 - Péter Madarasi:
The Distance Matching Problem. ISCO 2020: 202-213 - Yuya Masumura, Taihei Oki, Yutaro Yamaguchi:
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. ISCO 2020: 237-248 - Mayssoun Messaoudi, Issmail El Hallaoui, Louis-Martin Rousseau, Adil Tahir:
Solving a Real-World Multi-attribute VRP Using a Primal-Based Approach. ISCO 2020: 286-296 - Flávio Keidi Miyazawa, Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi:
Cut and Flow Formulations for the Balanced Connected k-Partition Problem. ISCO 2020: 128-139 - Chaghoub Soraya, Ibrahima Diarrassouba:
A Polyhedral Study for the Buy-at-Bulk Facility Location Problem. ISCO 2020: 42-53 - Kenjiro Takazawa:
Notes on Equitable Partitions into Matching Forests in Mixed Graphs and b-branchings in Digraphs. ISCO 2020: 214-224 - Raouia Taktak, Eduardo Uchoa:
On the Multiple Steiner Traveling Salesman Problem with Order Constraints. ISCO 2020: 66-77 - Renan Spencer Trindade, Olinto C. B. de Araújo, Marcia Fampa:
Arc-Flow Approach for Parallel Batch Processing Machine Scheduling with Non-identical Job Sizes. ISCO 2020: 179-190 - Piotr Wojciechowski, Matthew D. Williamson, K. Subramani:
On Finding Shortest Paths in Arc-Dependent Networks. ISCO 2020: 249-260 - Mourad Baïou, Bernard Gendron, Oktay Günlük, Ali Ridha Mahjoub:
Combinatorial Optimization - 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4-6, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12176, Springer 2020, ISBN 978-3-030-53261-1 [contents] - 2018
- Faisal N. Abu-Khzam, Judith Egan, Serge Gaspers, Alexis Shaw, Peter Shaw:
Cluster Editing with Vertex Splitting. ISCO 2018: 1-13 - Zacharie Alès, Sourour Elloumi:
Compact MILP Formulations for the p-Center Problem. ISCO 2018: 14-25 - José Carlos Almeida Jr., Felipe de C. Pereira, Marina V. A. Reis, Breno Piva:
The Next Release Problem: Complexity, Exact Algorithms and Computations. ISCO 2018: 26-38 - Evangelos Anagnostopoulos, Ioannis Z. Emiris, Vissarion Fisikopoulos:
Polytope Membership in High Dimension. ISCO 2018: 39-51 - Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono:
Graph Orientation with Splits. ISCO 2018: 52-63 - Mourad Baïou, Rafael Colares, Hervé Kerivin:
The Stop Number Minimization Problem: Complexity and Polyhedral Analysis. ISCO 2018: 64-76 - Pierre-Olivier Bauguion, Claudia D'Ambrosio, Leo Liberti:
Maximum Concurrent Flow with Incomplete Data. ISCO 2018: 77-88 - Flavia Bonomo, María Pía Mazzoleni, Mariano Leonardo Rean, Bernard Ries:
Characterising Chordal Contact B_0 -VPG Graphs. ISCO 2018: 89-100 - Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Maria Inés Lopez Pujato, Martin Milanic:
Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs. ISCO 2018: 290-302 - Graham Cormode, Jacques Dark, Christian Konrad:
Approximating the Caro-Wei Bound for Independent Sets in Graph Streams. ISCO 2018: 101-114