| 2018 | 2 CSPs All Are Approximable Within a Constant Differential Factor. Jean-François Culus, Sophie Toulouse |
| 2018 | A Branch-and-Bound Procedure for the Robust Cyclic Job Shop Problem. Idir Hamaz, Laurent Houssin, Sonia Cafieri |
| 2018 | A Generalization of the Minimum Branch Vertices Spanning Tree Problem. Massinissa Merabet, Jitamitra Desai, Miklós Molnár |
| 2018 | A Heuristic for Maximising Energy Efficiency in an OFDMA System Subject to QoS Constraints. Adam N. Letchford, Qiang Ni, Zhaoyu Zhong |
| 2018 | A Multigraph Formulation for the Generalized Minimum Spanning Tree Problem. Ernando Gomes de Sousa, Rafael Castro de Andrade, Andréa Cynthia Santos |
| 2018 | A PTAS for the Time-Invariant Incremental Knapsack Problem. Yuri Faenza, Igor Malinovic |
| 2018 | A Polyhedral View to Generalized Multiple Domination and Limited Packing. José Neto |
| 2018 | Alternating Current Optimal Power Flow with Generator Selection. Esteban Salgado, Andrea Scozzari, Fabio Tardella, Leo Liberti |
| 2018 | 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 |
| 2018 | An Exact Column Generation-Based Algorithm for Bi-objective Vehicle Routing Problems. Estèle Glize, Nicolas Jozefowiez, Sandra Ulrich Ngueveu |
| 2018 | An Integer Programming Approach to the Student-Project Allocation Problem with Preferences over Projects. David F. Manlove, Duncan Milne, Sofiat Olaosebikan |
| 2018 | Approximating the Caro-Wei Bound for Independent Sets in Graph Streams. Graham Cormode, Jacques Dark, Christian Konrad |
| 2018 | Characterising Chordal Contact B_0 -VPG Graphs. Flavia Bonomo, María Pía Mazzoleni, Mariano Leonardo Rean, Bernard Ries |
| 2018 | Characterization and Approximation of Strong General Dual Feasible Functions. Matthias Köppe, Jiawei Wang |
| 2018 | Cluster Editing with Vertex Splitting. Faisal N. Abu-Khzam, Judith Egan, Serge Gaspers, Alexis Shaw, Peter Shaw |
| 2018 | Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers Jon Lee, Giovanni Rinaldi, Ali Ridha Mahjoub |
| 2018 | Compact MILP Formulations for the p-Center Problem. Zacharie Alès, Sourour Elloumi |
| 2018 | Descent with Mutations Applied to the Linear Ordering Problem. Olivier Hudry |
| 2018 | Efficient Algorithms for Measuring the Funnel-Likeness of DAGs. Marcelo Garlet Millani, Hendrik Molter, Rolf Niedermeier, Manuel Sorge |
| 2018 | Even Flying Cops Should Think Ahead. Anders Martinsson, Florian Meier, Patrick Schnider, Angelika Steger |
| 2018 | Finding Minimum Stopping and Trapping Sets: An Integer Linear Programming Approach. Alvaro Velasquez, K. Subramani, Steven L. Drager |
| 2018 | Graph Orientation with Splits. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono |
| 2018 | Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs. Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, María Inés Lopez Pujato, Martin Milanic |
| 2018 | Jointly Optimizing Replica Placement, Requests Distribution and Server Storage Capacity on Content Distribution Networks. Raquel Gerhardt, Tiago Neves, Luis Rangel |
| 2018 | Lovász-Schrijver PSD-Operator on Some Graph Classes Defined by Clique Cutsets. Annegret K. Wagler |
| 2018 | Maximum Concurrent Flow with Incomplete Data. Pierre-Olivier Bauguion, Claudia D'Ambrosio, Leo Liberti |
| 2018 | Multi-start Local Search Procedure for the Maximum Fire Risk Insured Capital Problem. Maria Isabel Gomes Salema, Lourdes B. Afonso, Nelson Chibeles-Martins, Joana M. Fradinho |
| 2018 | On Bounded Pitch Inequalities for the Min-Knapsack Polytope. Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson |
| 2018 | Online Firefighting on Trees. Pierre Coupechoux, Marc Demange, David Ellison, Bertrand Jouve |
| 2018 | Parameterized Algorithms for Module Map Problems. Frank Sommer, Christian Komusiewicz |
| 2018 | Polytope Membership in High Dimension. Evangelos Anagnostopoulos, Ioannis Z. Emiris, Vissarion Fisikopoulos |
| 2018 | Preemptively Guessing the Center. Christian Konrad, Tigran Tonoyan |
| 2018 | The Distance Polytope for the Vertex Coloring Problem. Bruno Dias, Rosiane de Freitas Rodrigues, Nelson Maculan, Javier Marenco |
| 2018 | The Minimum Rooted-Cycle Cover Problem. Denis Cornaz, Youcef Magnouche |
| 2018 | The Next Release Problem: Complexity, Exact Algorithms and Computations. José Carlos Almeida Jr., Felipe de Carvalho Pereira, Marina V. A. Reis, Breno Piva |
| 2018 | The Stop Number Minimization Problem: Complexity and Polyhedral Analysis. Mourad Baïou, Rafael Colares, Hervé Kerivin |