| 2020 | A Polyhedral Study for the Buy-at-Bulk Facility Location Problem. Chaghoub Soraya, Ibrahima Diarrassouba |
| 2020 | An Efficient Matheuristic for the Inventory Routing Problem. Pedro Diniz, Rafael Martinelli, Marcus Poggi |
| 2020 | An Experimental Study of ILP Formulations for the Longest Induced Path Problem. Fritz Bökler, Markus Chimani, Mirko H. Wagner, Tilo Wiedera |
| 2020 | Anchored Rescheduling Problems Under Generalized Precedence Constraints. Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau |
| 2020 | 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 |
| 2020 | Cardinality Constrained Multilinear Sets. Rui Chen, Sanjeeb Dash, Oktay Günlük |
| 2020 | Combinatorial Optimization - 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4-6, 2020, Revised Selected Papers Mourad Baïou, Bernard Gendron, Oktay Günlük, Ali Ridha Mahjoub |
| 2020 | Cut and Flow Formulations for the Balanced Connected k-Partition Problem. Flávio Keidi Miyazawa, Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi |
| 2020 | Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. Yuya Masumura, Taihei Oki, Yutaro Yamaguchi |
| 2020 | Dynamic and Stochastic Rematching for Ridesharing Systems: Formulations and Reductions. Gabriel Homsi, Bernard Gendron, Sanjay Dominik Jena |
| 2020 | Handling Separable Non-convexities Using Disjunctive Cuts. Claudia D'Ambrosio, Jon Lee, Daphne E. Skipper, Dimitri Thomopulos |
| 2020 | Improving Proximity Bounds Using Sparsity. Jon Lee, Joseph Paat, Ingo Stallknecht, Luze Xu |
| 2020 | Notes on Equitable Partitions into Matching Forests in Mixed Graphs and b-branchings in Digraphs. Kenjiro Takazawa |
| 2020 | On Finding Shortest Paths in Arc-Dependent Networks. Piotr Wojciechowski, Matthew D. Williamson, K. Subramani |
| 2020 | On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs. Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini |
| 2020 | On the Linear Relaxation of the s-t-cut Problem with Budget Constraints. Hassene Aissi, Ali Ridha Mahjoub |
| 2020 | On the Multiple Steiner Traveling Salesman Problem with Order Constraints. Raouia Taktak, Eduardo Uchoa |
| 2020 | On the p-Median Polytope and the Directed Odd Cycle Inequalities. Mourad Baïou, Francisco Barahona |
| 2020 | Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs. Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret K. Wagler |
| 2020 | Polynomial Scheduling Algorithm for Parallel Applications on Hybrid Platforms. Massinissa Ait Aba, Lilia Zaourar, Alix Munier |
| 2020 | Quasi-Separable Dantzig-Wolfe Reformulations for Network Design. Antonio Frangioni, Bernard Gendron, Enrico Gorgone |
| 2020 | Scheduling with Non-renewable Resources: Minimizing the Sum of Completion Times. Kristóf Bérczi, Tamás Király, Simon Omlor |
| 2020 | Solving a Real-World Multi-attribute VRP Using a Primal-Based Approach. Mayssoun Messaoudi, Issmail El Hallaoui, Louis-Martin Rousseau, Adil Tahir |
| 2020 | The Distance Matching Problem. Péter Madarasi |
| 2020 | The Knapsack Problem with Forfeits. Raffaele Cerulli, Ciriaco D'Ambrosio, Andrea Raiconi, Gaetano Vitale |