View the program in our Progressive Web App
Program for stream Combinatorial Optimization I
Sunday
Monday
Monday, 8:30-10:00
MA-08: Multi-Objective Combinatorial Optimization
Stream: Combinatorial Optimization I
Room: SOUTH BUILDING UV S108 (building 0)
Chair(s):
Matthias Ehrgott
-
The multiobjective Dijkstra's algorithm
Antonio Sedeño-Noda, Marcos Colebrook -
Leveraging single-objective heuristics to solve multi-objective problems: applications in vehicle routing
Piotr Matl, Richard Hartl, Thibaut Vidal -
Solving a bi-objective stochastic facility location problem by branch-and-cut
Sophie Parragh, Walter Gutjahr, Fabien Tricoire -
Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
Matthias Ehrgott, Sune Lauth Gadegaard, Lars Relund Nielsen
Monday, 10:30-12:00
MB-08: Complexity Aspects of Linear and Integer Linear Programming
Stream: Combinatorial Optimization I
Room: SOUTH BUILDING UV S108 (building 0)
Chair(s):
Sergei Chubanov
-
Disjunctive conic cuts: the good, the bad, and implementation
Julio C. Góez -
Pyramidally solvable cases of the bipartite TSP
Vladimir Deineko -
The load planning and sequencing problem for double-stack intermodal trains
Moritz Ruf, Jean-François Cordeau, Emma Frejinger -
Integer optimization with verification oracles
Sergei Chubanov
Monday, 12:30-14:00
MC-08: Optimal Location Problems
Stream: Combinatorial Optimization I
Room: SOUTH BUILDING UV S108 (building 0)
Chair(s):
Ivana Ljubic
-
An exact algorithm for the perfect edge domination problem
Abilio Lucena -
Cost and fairness optimization in facility location
Carlo Filippi, Gianfranco Guastaroba, M. Grazia Speranza -
Benders decomposition for covering location problems
Ivana Ljubic, Jean-François Cordeau, Fabio Furini
Monday, 14:30-16:00
MD-08: Advances in Combinatorial Optimization
Stream: Combinatorial Optimization I
Room: SOUTH BUILDING UV S108 (building 0)
Chair(s):
Silvano Martello, Paolo Toth
-
Longitudinal analysis of heuristic performance
Steven Verwerft, Kenneth Sörensen -
Finding shortest pairs of paths with the fewest shared labels
Marta Pascoal, Joao Clímaco -
A mixed integer linear programming model for rolling stock rebalancing
Federico Farina, Dennis Huisman, Roberto Roberti, Shadi Sharif Azadeh -
A robust optimization approach for the cyclic job shop problem
Idir Hamaz, Laurent houssin, Sonia Cafieri
Tuesday
Tuesday, 8:30-10:00
TA-08: Combinatorial Optimization on Graphs I
Stream: Combinatorial Optimization I
Room: SOUTH BUILDING UV S108 (building 0)
Chair(s):
Francesco Carrabs
-
The discrete P-dispersion problem for the close enough traveling salesman problem
Carmine Cerrone, Francesco Carrabs, Raffaele Cerulli, Bruce Golden -
A three-stage p-median based exact method for the optimal diversity management problem
Adriano Masone, Antonio Sforza, Claudio Sterle, Igor Vasilyev, Anton Ushakov -
On a network function virtualization chaining problem with simple path routing: properties and formulations
Giuliana Carello, Bernardetta Addis, Meihui Gao -
A metaheuristic algorithm for the all-colors shortest path problem
Francesco Carrabs, Raffaele Cerulli, Andrea Raiconi
Tuesday, 10:30-12:00
TB-08: Combinatorial Optimization on Graphs II
Stream: Combinatorial Optimization I
Room: SOUTH BUILDING UV S108 (building 0)
Chair(s):
Raffaele Cerulli
-
Heuristic algorithms for the strong generalized minimum label spanning tree
Andrea Raiconi, Carmine Cerrone, Ciriaco D'Ambrosio -
On the single door cross-docking problem
Marcello Sammarra, Manlio Gaudioso, M. Flavia Monaco -
A GRASP for the supervised learning minimum cost SAT problem
Giovanni Felici, Paola Festa, Tommaso Pastore, Daniele Ferone, Antonio Napoletano -
Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator
Adrien CAMBIER, Michael Poss, Rosa Maria Figueiredo, Matthieu Chardy, Adam Ouorou
Tuesday, 12:30-14:00
TC-08: Applications in Industry and Services I
Stream: Combinatorial Optimization I
Room: SOUTH BUILDING UV S108 (building 0)
Chair(s):
José Fernando Oliveira
-
A dynamic IRP approach for the smart waste collection problem
Tania Ramos, Carolina Soares de Morais, Ana Barbosa-Povoa -
A heuristic approach to dispatch and conflict-free routing problem of capacitated vehicles for container transfers and relocations in a warehouse setting
Emmanouil Thanos, Tony Wauters, Greet Vanden Berghe -
Cruise itineraries optimal scheduling
Gianni Di Pillo, Stefano Lucidi, Renato Mari, Massimo Roma -
Integrating capacity and pricing under uncertainty in the car rental business
José Fernando Oliveira, Beatriz Brito Oliveira, Maria Antónia Carravilla, Alysson Costa
Tuesday, 14:30-16:00
TD-08: Applications in Industry and Services II
Stream: Combinatorial Optimization I
Room: SOUTH BUILDING UV S108 (building 0)
Chair(s):
Helena Ramalhinho Lourenco
-
A branch-price-and-cut algorithm for optimal decoding in LDPC-based communications
Banu Kabakulak, Z. Caner Taşkın, Ali Emre Pusane -
A dual-ramp algorithm for the uncapacitated multiple allocation hub location problem
Telmo Matos, Fábio Maia, Dorabela Gamboa -
Using mobile electric platforms for droid or drone-based last mile deliveries
Hagen Salewski, Dominik Goeke -
Optimizing factory logistics in an automotive industry
Helena Ramalhinho Lourenco, Marcelus Lima
Wednesday
Wednesday, 10:30-12:00
WB-08: Optimization Problems on Graphs and Networks
Stream: Combinatorial Optimization I
Room: SOUTH BUILDING UV S108 (building 0)
Chair(s):
Michele Monaci
-
Decision diagrams for solving a prize-collecting sequencing problem
Johannes Maschler, Günther Raidl -
Solving the order batching and picker routing problem as a clustered vehicle routing problem
Babiche Aerts, Trijntje Cornelissens, Kenneth Sörensen -
Monotonicity and conformality in multicommodity network-flow problems
Daniel Granot, Frieda Granot -
An empirical investigation of network polarization
Celso Ribeiro, Ruben Interian
Wednesday, 12:30-14:00
WC-08: Topics in Combinatorial Optimization
Stream: Combinatorial Optimization I
Room: SOUTH BUILDING UV S108 (building 0)
Chair(s):
Valentina Cacchiani
-
Approximating the incremental knapsack problem
Ulrich Pferschy, Federico Della Croce, Rosario Scatamacchia -
Fractional knapsack problem with penalties: models and algorithms
Michele Monaci, Enrico Malaguti, Paolo Paronuzzi, Ulrich Pferschy -
A path-based formulation for the 2-reservoir hydro unit commitment problem
Dimitri Thomopulos, Wim van Ackooij, Pascal Benchimol, Claudia D'Ambrosio -
On the value of integration in supply chain planning
Martin Kidd, Maryam Darvish, Leandro Coelho
Wednesday, 14:30-16:00
WD-08: Advances in Combinatorial Aspects of Optimal Control
Stream: Combinatorial Optimization I
Room: SOUTH BUILDING UV S108 (building 0)
Chair(s):
João Lauro Faco'
-
Design and development of discrete optimization approach for agro product clustering: case study of TR72 region in Turkey
Giray Resat -
Optimal coordinated bidding of a profit maximizing risk-averse EV aggregator under uncertainty
Yelena Vardanyan, Henrik Madsen -
Solving linearly-constrained mixed-integer nonlinear (MINLP) global optimization using GRASP metaheuristic
João Lauro Faco', Ricardo Silva, Mauricio Resende