Accepted papers


Papers accepted for the LNCS proceedings and presentation

  • Manuel Aprile, Alfonso Cevallos and Yuri Faenza. On Vertices and Facets of Combinatorial 2-Level Polytopes
  • Fabio D'Andreagiovanni and Ambros Gleixner. Towards an accurate solution of wireless network design problems
  • Corinna Gottschalk, Hendrik Lüthen, Britta Peis and Andreas Wierz. Optimization Problems with Color-Induced Budget Constraints
  • Gustavo Dias and Leo Liberti. Diagonally dominant programming in distance geometry
  • Yuni Iwamasa. On a general framework for network representability in discrete optimization
  • Stefano Coniglio, Arie Koster and Nils Spiekermann. On robust lot sizing problems with storage deterioration, with applications to heat and power cogeneration
  • Daniel Paulusma, Christophe Picouleau and Bernard Ries. Reducing the clique and chromatic number via edge contractions and vertex deletions
  • Veerle Timmermans and Tobias Harks. Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games
  • Marika Ivanova. Shared Multicast Trees in Ad Hoc Wireless Networks
  • Samuel Fiorini, Vissarion Fisikopoulos and Marco Macchia. Two-level Polytopes with a Prescribed Facet
  • Matthias Koeppe and Yuan Zhou. Toward computer-assisted discovery and automated proofs of cutting plane theorems
  • Samuli Leppänen, Adam Kurpisz and Monaldo Mastrolilli. Sum-of-Squares rank upper bounds for matching problems
  • Lucas Létocart and Angelika Wiegele. Exact Solution Methods for the k-item Quadratic Knapsack Problem
  • Oliver Czibula, Hanyu Gu and Yakov Zinder. Scheduling Personnel Retraining: a Column Generation Approach
  • Kazutoshi Ando and Koki Sato. An Algorithm for Finding a Representation of a Subtree Distance
  • Hiroshi Hirai and Taihei Oki. A compact representation for minimizers of k-submodular function
  • Susumu Morito, Yuho Takehi, Jun Imaizumi and Takayuki Shiina. Optimization Models for Multi-Period Railway Rolling Stock Assignment
  • Lucas Assunção, Andréa Cynthia Santos, Thiago F. Noronha and Rafael Andrade. On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0-1 Min-max Regret Optimization Problems with Interval Costs
  • Silvia Bianchi, Mariana Escalante, Graciela Nasini and Annegret Wagler. Lovasz-Schrijver PSD-operator on Claw-Free Graphs
  • Christoph Buchheim, Maribel Montenegro and Angelika Wiegele. A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs
  • Adam N. Letchford, Francesca Marzi, Fabrizio Rossi and Stefano Smriglio. Strengthening Chvatal-Gomory cuts for the stable set problem
  • Michele Barbato, Roland Grappe, Mathieu Lacroix and Roberto Wolfler Calvo. A Set Cover Approach for the Double Traveling Salesman Problem with Multiple Stacks
  • Diego Recalde, Daniel Severín, Ramiro Torres and Polo Vaca. Balanced Partition of a Graph for Football Team Realignment in Ecuador
  • Walid Ben-Ameur, Antoine Glorieux and Jose Neto. A full description of polytopes related to the index of the lowest nonzero row of an assignment matrix
  • Sara Mattia. Benders decomposition for capacitated network design
  • Cristiano Arbex Valle, John E Beasley and Alexandre Salles Da Cunha. Modelling and solving the joint order batching and picker routing problem in inventories
  • Matúš Mihalák, Katerina Bohmova and Enrico Kravina. Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores
  • Rafael S. Coelho and Yoshiko Wakabayashi. Approximation algorithms for the k-hop connected dominating set problem
  • Claudio Arbib, Giovanni Felici, Mara Servilio and Paolo Ventura. Optimum solution of the closest string problem via rank distance
  • Borzou Rostami, Christopher Strothmann and Christoph Buchheim. A decomposition approach for single allocation hub location problems with multiple capacity levels
  • Maximilian John and Andreas Karrenbauer. A Novel SDP Relaxation for the Quadratic Assignment Problem using Cut Pseudo Bases
  • Hiroshi Nishiyama, Yukiko Yamauchi, Shuji Kijima and Masafumi Yamashita. The Parity Hamiltonian Cycle Problem in Directed Graphs
  • Filippo Focacci, Fabio Furini, Virginie Gabrel, Daniel Godard and Xueying Shen. MIP Formulations for a Rich Real-world Lot-sizing Problem with Setup Carryover
  • Azeddine Cheref, Christian Artigues, Jean-Charles Billaut and Sandra Ulrich Ngueveu. Integrated production scheduling and delivery routing: complexity results and column generation
  • Marin Bougeret, Guillerme Duvillié and Rodolphe Giroudeau. Approximability and exact resolution of the Multidimensional Binary Vector Assignment problem
  • María Patricia Dobson and Valeria Leoni. Towards a polynomial equivalence between k-packing functions and k-limited packings in graphs
  • Youcef Magnouche and Sébastien Martin. The Multi-terminal vertex separator problem: Polytope characterization and TDI-ness
  • Dimitri Watel and Pierre-Louis Poirion. The Maximum Matrix Contraction problem
  • Mohammed-Albarra Hassan, Imed Kacem, Sebastien Martin and Izzeldin M.Osman. Unrelated Parallel Machine Scheduling Problem With precedence Constraints: Polyhedral Analysis and Branch-and-Cut


Papers accepted for presentation

  • Adam Letchford and Anh Vu. New Very-Large Scale Neighbourhoods for a Family of Partitioning Problems
  • Stephen Maher, Gregor Hendel and Yuji Shinano. General disjunction branching based on objective function improvement
  • Andreas Bärmann, Thorsten Gellermann, Frauke Liers, Maximilian Merkert and Oskar Schneider. Multiple-Choice Problems under Staircase Compatibility and their Applications in Timetabling and Routing
  • Jamie Fairbrother and Adam Letchford. Projection Results for the k-Partition Problem
  • Libor Bukata, Přemysl Šůcha and Zdeněk Hanzálek. A Tight Relaxation of the Energy Optimization Problem
  • Meriem Mahjoub, Ibrahima Diarrassouba and Ridha Mahjoub. Survivable Networks with high connectivity requirements: Valid inequalities and Branch-and-Cut
  • Martin Luipersbeck, Markus Leitner, Ivana Ljubic and Markus Sinnl. A dual-ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
  • Markus Sinnl, Matteo Fischetti, Michele Monaci and Ivana Ljubic. On interdiction problems over independence systems
  • Pascale Bendotti, Pierre Fouilhoux and Cécile Rottner. Min-up/Min-down Unit Commitment Problem: Complexity and Valid Inequalities
  • Dang Phuong Nguyen, Michel Minoux, Thanh Hai Nguyen, Viet Hung Nguyen and Renaud Sirdey. Improved compact formulations for a wide class of graph partitioning problems in sparse graphs
  • Agustin Mosteiro, Juan Jose Miranda Bront and Federico Pousa. ILP formulations for the railway rescheduling problem under large disruptions
  • Luis Gouveia, Markus Leitner and Mario Ruthmair. Flow and Layered Graph Models for the Black-and-White Traveling Salesman Problem
  • Denis Cornaz, Roland Grappe and Mathieu Lacroix. Tarder Multiflow
  • Pasquale Avella, Maurizio Boccia, Carlo Mannino and Igor Vasilyev. Strengthened time-indexed formulations for airport runway scheduling
  • Aurélien Froger, Michel Gendreau, Jorge E. Mendoza, Eric Pinson and Louis-Martin Rousseau. A branch-and-check approach to solve a wind turbine maintenance scheduling problem
  • Carlo Filippi, Wlodzimierz Ogryczak and M.Grazia Speranza. Discrete Conditional Value-at-Risk
  • Claudia Archetti, Natashia Boland and M. Grazia Speranza. A matheuristic for the multi-vehicle inventory routing problem
  • Sigrid Knust and Stefan Waldherr. Synchronous flow shop problems with dominating machines
  • Igor Averbakh and Jorge Pereira. Lateness minimization for pairwise connection restoration problems
  • Thanh Le Xuan and Sigrid Knust. Robust storage loading problems with stacking constraints
  • François Clautiaux, Said Hanafi, Rita Macedo, Marie-Emilie Voge and Cláudio Alves. Iterative Aggregation and Disaggregation Algorithm for Pseudo-Polynomial Network Flow Models with Side Constraints
  • Stefan Poikonen, Xingyin Wang and Bruce Golden. Vehicle Routing Problem with Drones: Worst-Case Bounds and Related Problems
  • Georg Brandstätter, Markus Leitner, Ivana Ljubic and Mario Ruthmair. Designing optimal charging station networks for electric car sharing systems
  • Luis Gouveia, Pierre Pesneau, Mario Ruthmair and Daniel Santos. Network flow precedence based formulations for the asymmetric traveling salesman problem with precedence constraints
  • Markus Leitner, Ivana Ljubic, Martin Riedler and Mario Ruthmair. Exact Approaches for Network Design Problems with Relays
  • Jeremy Guillot, Francois Clautiaux and Pierre Pesneau. Aggregation technique applied to a clustering problem
  • Halil Sen, Boris Detienne, Ruslan Sadykov and Francois Vanderbeck. A review of algorithmic enhancements for Benders decomposition
  • Elif Mete. Energy Network Management of an Oil Refinery
  • Fouad Ben Abdelaziz and Hasan Mir. Optimization of multitask radars
  • Annabella Astorino, Manlio Gaudioso and Giovanna Miglionico. The directional sensor coverage problem with continuous orientation
  • Charly Lersteau, Marc Sevaux, André Rossi, Raffaele Cerulli and Andrea Raiconi. Maximization of residual capacities for target tracking in wireless sensor networks
  • Demetrio Laganà and Annarita De Maio. A Matheuristic algorithm for the multi-depot Inventory Routing Problem
  • Jérôme De Boeck and Bernard Fortz. Hop-constrained electricity network design problems
  • Ibrahima Diarrassouba, Pedro Henrique Liguori and A. Ridha Mahjoub. The Asymmetric VPN Tree Problem: Formulation and Polyhedral Investigation
  • Sel Ozcan, Deniz Türsel Eliiyi and Levent Kandiller. A novel MILP formulation and Bounds for the Makespan Minimization Problem on Assembly Lines
  • Stefan Poikonen. A Convex Programming Approach to Drone Routing with Obstacles and Physical Constraints
  • Olivier Briant and Denis Naddef. Loading containers with boxes: the ESICUP Renault Challenge
  • Cheng-Jhe Lee, Chiun-Chieh Hsu and Yu-Chun Chu. Multiple Disjoint Spanning Trees for Bi-Rotator Graphs
  • Hande Öztop, Deniz Türsel Eliiyi and Uğur Eliiyi. Timetabling of Bus Lines through Discrete Event Simulation
  • Torkel Andreas Haufmann, Agostinho Agra, Geir Dahl and Sofia Pinheiro. The k-regular induced subgraph problem
  • Elisabeth Gaar and Franz Rendl. Using Exact Subgraph Constraints for Improving the Lovász Theta Function as Bound on the Stability Number and the Coloring Number
  • Siao-Leu Phouratsamay, Safia Kedad-Sidhoum and Fanny Pascual. Two-level supply chain coordination under complete or asymmetric information
  • Alexandre Salles Da Cunha and Philippe Mahey. Polyhedral and semidefinite programming approaches for the Quadratic Set Covering Problem
  • Silvia Bianchi, Graciela Nasini, Paola Tolomei and Luis Miguel Torres. The set covering polyhedron of circular matrices: Minor vs. row family inequalities
  • Raphael Kramer, Mauro Dell'Amico and Manuel Iori. An iterated local search algorithm for the bin packing problem with generalized precedence constraints
  • Manel Kamoun, Houda Derbel and Bassem Jarboui. Hybrid Genetic Algorithm with Local Search For The Multi-vehicle Covering Tour Problem
  • Deepak Mehta, Barry O'Sullivan, Cemalettin Ozturk and Luis Quesada. OR and AI Methods to Solve Diameter and Degree Constrained Network Design Problems
  • Majid Khalili, Hamed Tayebi and Mehran Esmailpour. The production-distribution problem with order acceptance and package delivery: models and algorithm
  • Cédric Bentz, Marie-Christine Costa, Daniel Porumbel and Thomas Ridremont. Robust Optimization of wiring in wind-farms: a robust Steiner Tree problem
  • Vinícius Morais, Geraldo Robson Mateus and Bernard Gendron. The p-Cycle Star Problem: Formulations and cutting-plane methods
  • Omar Latorre and Rosiane de Freitas. The Closest String Problem with 4-string is enough for its NP-hardness
  • Pierre-Louis Poirion, Jean-François Baffier and Vorapong Suppakitpaisarn. Bilevel Model for Network Interdiction Problems
  • Lucas Hassan, Nicolas Dupin, Rémi Parize. Robust optimization for resource-constrained project scheduling in the French Procurement Agency (DGA)
  • Alain Billionnet, Marie-Christine Costa and Pierre-Louis Poirion. A dynamic programming approach to design a robust renewable energy park
  • Francesco Carrabs, Raffaele Cerulli, Ciriaco D'Ambrosio and Andrea Raiconi. An exact and a heuristic approach for maximizing lifetime in sensor networks with coverage and connectivity constraints
  • Selene Silvestri, Gilbert Laporte and Raffaele Cerulli. A Branch-and-Cut approach for the Minimum Branch Vertices Spanning Tree Problem



Call for Papers

Submission Deadline - Final Extension: February 29, 2016

Extended Submission Deadline: February 22, 2016

Submission deadline: February 15, 2016


Notification of authors: April 10, 2016

Notification of authors: March 29, 2016


Topics of interest include, but are not limited to:

  • Approximation algorithms
  • Graph and network algorithms
  • Branch-and-bound algorithms
  • Interior point methods
  • Branch-and-cut-and-price algorithms
  • Linear and nonlinear integer programming    
  • Computational biology
  • Local search algorithms
  • Computational complexity
  • Metaheuristics
  • Computational geometry
  • On-line algorithms
  • Constraint programming
  • Polyhedral combinatorics
  • Cutting plane algorithms
  • Randomized algorithms
  • Exact and parameterized algorithms
  • Scheduling algorithms
  • Multicriteria Optimization
  • Game Theory



Papers presenting original unpublished results in all areas of combinatorial optimization and its applications are welcome.

There will be two types of submissions: regular papers and short papers. All accepted regular and short papers must be presented at the conference, and will be given an equal amount of time.

All papers should be submitted electronically following the instructions on this page and by following this link:


Regular papers

Accepted regular papers will be published by Springer-Verlag in the Lecture Notes in Computer Science (LNCS) series in a post-conference proceedings volume. For a paper to be included in this volume, it should be presented at the conference by one of the authors. The authors will have to prepare their latex camera-ready version within two weeks after the end of ISCO 2016.

Regular papers cannot exceed 12 pages, including front matter and bibliography, in LNCS style see . Proofs omitted due to space constraints may be included in a clearly marked appendix which will be taken into account by the program committee members and the reviewers, but they will not be published in the post-conference proceedings volume. Simultaneous submission to other conferences with published proceedings or journals is not allowed.

The authors are required to use the submission form available at the address to:

  • Upload the pdf file of the 12-page regular paper in LNCS style on the easychair platform.
  • Paste in the Abstract textbox a 1-page abstract (maximum 3000 characters, including spaces) to be included in the abstracts booklet which will be distributed during the conference. At most 4 references can be included. Mathematical formulas can be included in LaTeX notation.




Short papers

Submitted short papers should not exceed one page (maximum 3000 characters, including spaces). At most 4 references can be included. Mathematical formulas can be included in LaTeX notation. Accepted papers should be presented at the conference by one of the authors.

To submit a short paper, please go to and paste the text in the Abstract textbox of the submission form.

Accepted short papers will appear in the abstracts booklet which will be distributed during the conference.