accepted regular papers
To be published in the LNCS post-conference proceedings volume.
(37 out of 94, acceptance rate 39.4%)
-
Cid C. De Souza and Breno Piva.
The Minimum Stabbing Triangulation Problem: IP Models and Computational Evaluation -
Matteo Fischetti and Leo Liberti
Orbital shrinking -
Laura Galli, Konstantinos Kaparis and Adam Letchford
Gap Inequalities for the Max-Cut Problem: a Cutting-Plane Algorithm -
Trivikram Dokka, Ioannis Mourtos and Frits Spieksma
Fast Separation Algorithms for Three-Index Assignment problems -
Yuri Faenza, Samuel Fiorini, Roland Grappe and Hans Raj Tiwary
Extended formulations, non-negative factorizations, and randomized communication protocols -
Gábor Braun and Sebastian Pokutta
An algebraic approach to symmetric extended formulations -
Alexandre Freire, Vicente Acuna, Pierluigi Crescenzi, Carlos Ferreira, Vincent Lacroix, Paulo Vieira Milreu, Eduardo Moreno and Marie-France Sagot
Minimum ratio cover of matrix columns by extreme rays of its induced cone -
Gabriela Argiroffo, Graciela Nasini and Pablo Torres
The Packing Coloring Problem for (q,q-4) graphs -
Leonardo Martinez and Alexandre Cunha
A Parallel Lagrangian Relaxation Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem -
Sophie Toulouse
Differential Approximation of the Multiple Stacks TSP -
Yuichi Asahiro, Jesper Jansson, Eiji Miyano and Hirotaka Ono
Graph Orientations Optimizing the Number of Light or Heavy Vertices -
James Ostrowski
Using Symmetry to Optimize Over the Sherali-Adams Relaxation -
Luis Gouveia, Markus Leitner and Ivana Ljubic
On the Hop Constrained Steiner Tree Problem with multiple Root Nodes -
Satoru Fujishige and Jens Massberg
Dual Consistent Systems of Linear Inequalities and Cardinality Constrained Polytopes -
Agostinho Agra, Marielle Christiansen, Rosa Figueiredo, Lars Magnus Hvattum, Michael Poss and Cristina Requejo
Layered Formulation for the Robust Vehicle Routing Problem with Time Windows -
Monique Laurent and Antonios Varvitsiotis
The Gram dimension of a graph -
Jianqiang Cheng, Celine Gicquel and Abdel Lisser
A second-order Cone programming approximation to joint chance-constrained linear Programs -
Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau and Jean-Claude König
Sum-Max Graph Partitioning Problem -
Eduardo Álvarez-Miranda, Valentina Cacchiani, Tim Dorneth, Michael Jünger, Frauke Liers, Andrea Lodi, Tiziano Parriani and Daniel R. Schmidt
Models and Algorithms for Robust Network Design with Several Traffic Scenarios -
Fabio Furini, Carlo Alfredo Persiani and Paolo Toth
Aircraft sequencing problems via a rolling horizon algorithm -
Manuel Sorge, Hannes Moser, Rolf Niedermeier and Mathias Weller
Exploiting a Hypergraph Model for Finding Golomb Rulers -
Pierre Fouilhoux and Aurélien Questel
The Non-Disjoint m-Ring-Star Problem : polyhedral results and SDH/SONET network design -
Monaldo Mastrolilli and Georgios Stamoulis
Constrained Matching Problems in Bipartite Graphs -
Anna Huber and Vladimir Kolmogorov
Towards Minimizing k-Submodular Functions -
Pierre Bonami, Viet Hung Nguyen, Michel Klein and Michel Minoux
On the Solution of a Graph Partitioning Problem under Capacity Constraints -
Marie-Emilie Voge and François Clautiaux
Theoretical investigation of aggregation in pseudo-polynomial network-flow models -
Mario Ruthmair and Günther Raidl
On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem -
Rafael Schouery and Cristina Fernandes
Second-Price Ad Auctions with Binary Bids and Markets with Good Competition -
Agnes Gorge, Abdel Lisser and Riadh Zorgati
Semidefinite Relaxations for Mixed 0-1 Second-Order Cone Program -
Sylvie Borne, Roland Grappe and Mathieu Lacroix
The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks -
Marc Demange, Jérôme Monnot, Petrica Pop and Bernard Ries
Selective Graph Coloring in Some Special Classes of Graphs -
Tommy Färnqvist
Counting Homomorphisms via Hypergraph-based Structural Restrictions -
Konstantinos Papalamprou and Leonidas Pitsoulis
Recognition algorithms for binary signed-graphic matroids -
Bo Xiong and Christine Chung
Completion Time Scheduling and the WSRPT Algorithm -
Mikhail Kovalyov, Ammar Oulamara and Ameur Soukhal
Two agent scheduling on a serial batching machine -
Dennis Weyland, Roberto Montemanni and Luca Maria Gambardella
Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines -
Mathieu Lacroix, Ridha Mahjoub and Sebastien Martin
Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem