accepted short papers
-
Céline Gicquel, Abdel Lisser and Michel Minoux.
Tight lower bounds by semidefinite relaxation for a lot-sizing problem with sequence-dependent changeover costs -
Bendotti Pascale, Pierre Fouilhoux and Podkanski Karol.
Permutation Problem using a Unit-Capacity Robot : Feasibility Recovery and Cutting-plane based Formulation with MTZ strengthening -
Alain Billionnet, Fethi Jarray, Ghassen Tlig and Ezzedine Zagrouba.
Combining simulated annealing and linear programming approaches for reconstructing hv-convex colored images -
Michaël Gabay, Gerd Finke and Nadia Brauner.
Identical coupled task scheduling problem: the finite case -
Hipolito Hernandez Perez and Juan Jose Salazar Gonzalez.
Solving the multi-commodity many-to-many Pickup-and-Delivery Traveling Salesman Problem -
Luis Gouveia and Juan Jose Salazar.
Polynomial Separation of the Enhanced Reverse Multistar Inequalities -
Irène Charon and Olivier Hudry.
A branch and bound method for the aggregation of symmetric relations -
Tolga Bektas and Luis Gouveia.
A polyhedral approach for generalizing the Miller-Tucker-Zemlin subtour elimination constraints for routing problems -
Alexandre Cunha.
Algorithms for the Multi-period Degree Constrained Minimum Spanning Tree Problem -
Mette Gamst.
A route-based decomposition for the Multi-Commodity k-splittable Maximum Flow Problem -
Stefan Gollowitzer, Bernard Gendron and Ivana Ljubic.
Capacitated Network Design with Facility Location -
Nicolas Dupin.
A 2-stage robust optimization model for planning nuclear maintenances with uncertain maintenance durations -
Monaldo Mastrolilli and Georgios Stamoulis.
Restricted Max-Min Fair Allocation with Inclusion-free Intervals -
Miriam Kießling, Sascha Kurz and Jörg Rambau.
An exact column-generation approach for the lot-type design problem -
Valeria Leoni, Erica Hinrichsen and María Patricia Dobson.
Generalized Limited packings of P4-tidy graphs -
Walid Ben-Ameur, Pierre Bauguion and Eric Gourdin.
An efficient tree-based model for multicommodity flow problems -
Eric Gourdin and Yuhui Wang.
Bottleneck and Maxmin Transportation Problems with Degree Constraints -
Fabio Salassa, Wim Vancroonenburg, Tony Wauters, Federico Della Croce and Greet Vanden Berghe.
Matheuristics for the Eternity II puzzle -
Didem Gözüpek, Mordechai Shalom, Ariella Voloshin and Shmuel Zaks.
On the Complexity of Constructing Minimum Reload Cost Path-Trees -
Roland Grappe.
Polynomial cases of hypergraph local edge-connectivity augmentation -
Houssein Alaeddine, Emmanuel Neron, Kamal Serrhini and Mindjid Maizia.
Planning for evacuation -
Rafaelli Coutinho, Lúcia Drummond, Yuri Frota, Luidi Simonetti and Eduardo Uchoa.
A Distributed Transportation Simplex Applied to a Content Distribution Network Problem -
Pierre Fouilhoux.
Clique-branching formulation for the vertex coloring problem -
Laurent Alfandari, Anass Nagih, Agnès Plateau and Jalila Sadki.
Generalizations of Dobson approximation algorithm and cooperation with Column Generation for large-size Covering Integer Programs -
Pierre Le Bodic and Cédric Bentz.
On the complexity of Partial Colored Multiterminal Cut problems -
Eduardo Álvarez-Miranda, Ivana Ljubic, S. Raghavan and Paolo Toth.
The Recoverable Robust Two-Level Network Design Problem -
Sophie Toulouse, Jean-François Culus and Roupin Frédéric.
DIFFERENTIAL APPROXIMATION OF SNP OPTIMIZATION PROBLEMS -
Denis Cornaz, Herve Kerivin and Ridha Mahjoub.
A combinatorial linearization of the quadratic acyclic vertex-induced subgraph problem -
Mourad Baiou and Francisco Barahona.
The classical facility location polytope for graphs with no g-odd Y-cycle -
Amal Benhamiche, Ridha Mahjoub, Nancy Perrot and Eduardo Uchoa.
A Branch-and-Price Algorithm for the Optical Multi-Band Network Design Problem -
Hassene Aissi and A. Ridha Mahjoub.
On the constrained minimum s − t cut problem