View the program in our Progressive Web App
Program for stream Combinatorial Optimization
Monday
Tuesday
Tuesday, 10:00-11:40
TB-06: Combinatorial Optimization 1
Stream: Combinatorial Optimization
Room: Room 6
Chair(s):
Junyoung Kim
-
Fully decomposed Lagrangean relaxations of RLT-1 models for some quadratic 0-1 problems with linear constraints
Jongwoo Park, Monique Guignard-Spielberg -
The balanced maximally diverse grouping problem with attribute values
Arne Schulz -
Solving the unsplittable network flow problem using polar duality based cutting planes
Shuvabrata Chakraborty -
Rank-1 Chvátal-Gomory inequality for knapsack problem with generalized upper bound constraints
Junyoung Kim, Kyungsik Lee
Wednesday
Wednesday, 10:00-11:40
WB-06: Network design
Stream: Combinatorial Optimization
Room: Room 6
Chair(s):
Liang Chen
-
MPEC-based mixed-integer programming formulation for nonlinear network design
Arvind Raghunathan, Sreekanth Rajagopalan -
New Formulations for the Steiner Tree and Network Design
Trilochan Sastry -
An exact separation algorithm for the unsplittable flow capacitated network design arc-set polyhedron
Liang Chen, Wei-Kun Chen, Yu-Hong Dai
Wednesday, 18:00-19:40
WF-04: Routing problems
Stream: Combinatorial Optimization
Room: Room 4
Chair(s):
DONGQING ZHANG
-
An application of the multi-depot heterogeneous fixed fleet open vehicle routing problem
Arild Hoff, Lars Magnus Hvattum, Ketil Danielsen -
The strengthening of a relaxed mixed-integer programming formulation for an arc routing problem using a graph augmentation procedure
Rafael Kendy Arakaki, Fábio Usberti -
Analytics and Machine Learning in Vehicle Routing Research
Ruibin Bai -
Optimal multi-step routing policy problem in stochastic networks with link travel time correlation
DONGQING ZHANG, Zhaoxia Guo
Thursday
Thursday, 8:00-9:40
HA-05: Combinatorial Optimization 2
Stream: Combinatorial Optimization
Room: Room 5
Chair(s):
Liang Chen
-
Encoding constraint satisfaction problems as QUBO
Philippe Codognet -
Characterization of QUBO reformulations for the maximum k-colorable subgraph problem
Rodolfo Alexander Quintero Ospina, David E. Bernal, Tamás Terlaky, Luis Zuluaga -
Integer optimization models for the generalized temporal knapsack problem.
Jongyoon Park, Kyungsik Lee -
An empirical quantification of the impact of choice constraints on generalizations of the 0-1 knapsack problem using CPLEX
Yun Lu, Francis Vasko
Thursday, 18:00-19:40
HF-04: Applications of integer programming
Stream: Combinatorial Optimization
Room: Room 4
Chair(s):
Jørgen Skålnes
-
A new formulation for the inventory routing problem based on customer schedules
Jørgen Skålnes, Magnus Stålhane, Guy Desaulniers, Henrik Andersson -
A hybrid metaheuristic for the two-echelon inventory routing problem with lateral transshipments
Edgar E. Córdoba-Sarmiento, Javier Arias-Osorio, Laura Y. Escobar-Rodríguez -
An MILP model for multi-floor facility layout with elevators
Songsong Liu, Jude Ejeh, Lazaros Papageorgiou -
A Lot Sizing Problem in a Co-production Environment
Semra Agrali, Bahadir Pamuk, Z. Caner Taşkın, Banu Kabakulak