Program for stream Mixed Integer Linear Programming

MA-06: MILP algorithms for routing problems I
Stream: Mixed Integer Linear Programming
Room: Building Δ, Room Δ103
Chair(s): Roel Leus

• Exact algorithms for budgeted prize-collecting covering subgraph problems
  Nicola Morandi, Roel Leus, Hande Yaman
• A branch-and-price algorithm for the multi-depot multi-trip vehicle routing problems with time windows
  Kubra Sahin, Hande Yaman
• A novel sub-problem of the Vehicle Routing Problem with Time Windows
  Philipp Armbrust, Kerstin Maier, Christian Truden

MB-06: Mixed Integer Linear Programming for resource allocation
Stream: Mixed Integer Linear Programming
Room: Building Δ, Room Δ103
Chair(s): Rosario Scatamacchia

• Parallel batching with multi-size jobs
  Elena Rener, Alessandro Druetto, Erica Pastore
• Mixed Integer Programming Equilibria
  Gabriele Dragotto, Andrea Lodi
• On computing Pure Nash Equilibria for the two-player Knapsack Game and Potential Integer Programming Games
  Rosario Scatamacchia, Gabriele Dragotto

MC-06: Mixed Integer Linear Programming for transportation problems I
Stream: Mixed Integer Linear Programming
Room: Building Δ, Room Δ103
Chair(s): Carlo Mannino, Mohammad Reihaneh

• Dynamic Airspace Configuration in 5 minutes combining deep nets and unconstrained optimization
  Giorgio Grani, Carlo Mannino, Patrick Schittekat
• Design Factors for Optimized Railway Dispatch Under European Operating Rules
  Steven Harrod, Giuseppe Matera
• The Berth Allocation and Quay Crane Assignment Problem considering crane movement and setup times
  Juan F. Correcher, Federico Perea, Ramon Alvarez-Valdes
• A branch-and-price algorithm for the redundancy allocation problems
  Mohammad Reihaneh, Mostafa Abouei Ardakan, Majid Eskandarpour

MD-06: MILP in Manufacturing and Logistics
Stream: Mixed Integer Linear Programming
Room: Building Δ, Room Δ103
Chair(s): Fabrizio Marinelli

• Optimization models for an assort-and-cut problem in glass manufacturing with defective raw material
  Fabrizio Marinelli, Claudio Arbib, Mustafa Pinar, Andrea Pizzuti
• Optimizing the Locations of JIT/JIS Supermarkets in Automotive Production Plants
  Heinrich Kuhn, Marcel Lehmann, Mareike Mueller
• Benders decomposition for the balancing of assembly lines with collaborative robots
  Celso Gustavo Stall Sikora, Christian Weckenborg
• A polyhedral approach to some max-min problems
  Thomas Lidbetter

MG-30: Fairness and Game Theory
Stream: Mixed Integer Linear Programming
Room: Virtual Room 30
Chair(s): Margarida Carvalho

• On Fairness and Implementability in Stackelberg Security Games
  Victor Bucarey, Martine Labbé
• Optimal Capacity Expansion in the College Admission Problem
  Federico Bobbio, Margarida Carvalho, Alfredo Torrico, Andrea Lodi
• New integer programming models for stable kidney exchage problem
  Kseniia Klimentova, Péter Biró, Ana Viana, Virginia Costa, Flip Klijn, João Pedro Pedroso
• Individual fairness on kidney exchange programs
  Margarida Carvalho, William St-Arnaud, Golnoosh Farnadi, Behrouz Babaki

TB-30: MILP for energy efficiency and sustainability
Stream: Mixed Integer Linear Programming
Room: Virtual Room 30
Chair(s): Maurizio Bruglieri

• Waste Collection Point Location and Allocation Model with Hierarchical Clustering
  Adam Viktorin, Dušan Hrabec, Radovan Šomplák, Vlastimír Nevrlý
• A new ILP Model for a Line Balancing Problem with Minimization of Power Peak
  Paolo Gianessi, Xavier Delorme
• Routing a Mixed Fleet of Electric and Traditional Vehicles with Congestion Charge Areas
  Maurizio Bruglieri, Bülent Çatay, Merve Keskin, Simona Mancini, Ornella Pisacane
• Dantzig-Wolfe decompositions with linking variables
  Stefan Ropke, Jens Vinther Clausen, Richard Lusby

TC-30: OR in renewable energy
Stream: Mixed Integer Linear Programming
Room: Virtual Room 30
Chair(s): Martina Fischetti

• Mathematical Models to optimal dimensioning and managing battery energy storage for solar photovoltaic system of a multi-apartment building
  Lavinia Amorosi, Dell'Olmo Paolo
• Public Transport-based Crowd-shipping with Backup Transfers
  Barış Yıldız, Kerim Uygur Kızıl
• Optimization Models for Installation Planning of Offshore Wind Farms
  Martina Fischetti, Lavinia Amorosi, Rosario Paradiso, Roberto Roberti
• Considering turbulence in offshore wind farm layout optimization
  David Franz Koza, Davide Cazzaro

TD-30: MILP algorithms for routing problems II
Stream: Mixed Integer Linear Programming
Room: Virtual Room 30
Chair(s): Maria Battarra, Gunes Erdogan, Reza Shahin

• Stochastic Approaches for Truck/Drone Tandems in Humanitarian Applications
  Hannan Tureci Isik, Melih Çelik, Ece Sanci
• A trajectory optimisation-based heuristic for routing unmanned aerial vehicles in a disaster assessment application
  Walton Pereira Coutinho, Joerg Fliege, Maria Battarra, Anand Subramanian
• A branch-and-cut algorithm for the vehicle routing problem with three-dimensional loading constraints
  Felix Tamke, Leopold Kuttner, Florian Linß
• MILP for a MAST system
  Reza Shahin, Pierre Hosteins, Pierre-Olivier Vandanjon, Paola Pellegrini

TE-30: MILP in logistics
Stream: Mixed Integer Linear Programming
Room: Virtual Room 30
Chair(s): Daniel Rehfeldt

• A Mixed-Integer Programming Formulation to Minimize Weighted Tardiness in Additive Manufacturing Environment
  F. Tevhide Altekin, Yossi Bukchin
• A Column Generation approach for Container management in dry port
  Sebastian Fernandez-Garrido, Pablo A. Miranda, Gabriel Gutiérrez-Jarpa
• Robust Multistage Bin Packing via Quantified Programming
  Michael Hartisch, Tobias Marx
• Parallel solution of Steiner tree and related problems
  Daniel Rehfeldt, Thorsten Koch, Yuji Shinano

TF-30: MILP algorithms for graph coloring problems
Stream: Mixed Integer Linear Programming
Room: Virtual Room 30
Chair(s): Stefano Gualandi, Luca Ferrarini

• New SAT Models & Hybrid Algorithms for Graph Coloring
  Matthias Kaul, Stephan Held
• Graph Coloring with Decision Diagrams
  Willem-Jan van Hoeve
• Constraint and Satisfiability Reasoning for Graph Coloring
  George Katsirelos
• A Polyhedral Approach to the Total Coloring Problem
  Luca Ferrarini, Stefano Gualandi

WA-30: Mixed Integer Linear Programming for transportation problems II
Stream: Mixed Integer Linear Programming
Room: Virtual Room 30
Chair(s): Carlo Mannino, Giorgio Sartor

• A MILP model for quasi-periodic strategic train timetabling
  Giorgio Sartor, Carlo Mannino, Lukas Bach, Thomas Nygreen
• A logic Benders decomposition for microscopic railway timetable planning
  Florin Leutwiler, Francesco Corman
• MILP-based Algorithms for the Generalized Train Unit Shunting Problem
  Paola Pellegrini, Franck Kamenga, Joaquin Rodriguez, Boubekeur Merabet, Bertrand Houzel
• Rescheduling Trains with Speed Target Recommendation on Railway Lines Equipped with ATO System
  Zhengwen Liao, Lingyun Meng, Jianrui Miao, Jianpeng Dai, Yihan Tan

WB-30: Recent advances in MILP algorithms
Stream: Mixed Integer Linear Programming
Room: Virtual Room 30
Chair(s): Henri Lefebvre

• Selecting algorithm portfolio for mixed-integer programming without problem instance information
  Konstantin Sidorov, Renat Akhunzhanov
• Combinatorial Benders' cuts
  Aigerim Saken
• The Relaxed Nonfeasible-Basis Cutting plane method
  Kasitinart Sangngern, Aua-aree Boonperm
• A finite eps-convergence algorithm for 0-1 mixed-integer convex two-stage robust optimization with objective uncertainty
  Henri Lefebvre, Michele Monaci, Enrico Malaguti, Boris Detienne

WC-30: Recent development in Mixed Integer Linear Programming
Stream: Mixed Integer Linear Programming
Room: Virtual Room 30
Chair(s): Matthias Walter

• Exploiting Subgroup Structures in Symmetry Handling
  Christopher Hojny, Fabian Wegscheider
• Advances in Exact Rational Mixed Integer Programming
  Leon Eifler, Ambros Gleixner
• A Computational Study of Perspective Cuts
  Ksenia Bestuzheva, Ambros Gleixner, Stefan Vigerske
• Dynamic Partition Search - A Primal Heuristic exploiting Decomposition Information
  Katrin Halbig, Dieter Weninger
• Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs
  Matthias Walter