Program for stream Combinatorial Optimization

MB-19: Complex Topics in Combinatorial Optimization
Stream: Combinatorial Optimization
Room: FENH105 (building FEN-UChile)
Chair(s): Silvano Martello, Paolo Toth, Matheus Corrêa

• Algorithmic Tools for Congressional Districting: Fairness via Analytics
  David B. Shmoys
• Quantum Computing based Combinatorial Optimization: Applications toward Critical Infrastructure Management
  Gabriel San Martin, Enrique Lopez Droguett
• On von Neumann's cellular automata on bi and unidimensional grids
  Nei Yoshihiro Soma
• Reversal, Addition and Complement of Arcs in Digraphs: Formulations and Exact Solution Algorithms
  Matheus Corrêa, Abilio Lucena

MB-20: Combinatorial Optimization Problems Under Uncertainty
Stream: Combinatorial Optimization
Room: FENH106 (building FEN-UChile)
Chair(s): Anand Subramanian, Teobaldo Bulhões

• A strong compact formulation for the robust knapsack problem with its application to a lifting heuristic for robust cover inequalities
  Youngjoo Roh, Junyoung Kim, Kyungsik Lee
• Polynomial time algorithms for network connection problems with interval data
  Xudong Hu
• A Two-Stage Solution Approach for Electric Vehicle Routing Problem with Uncertain Waiting Times
  Merve Keskin, Nursen Aydin
• A matheuristic approach for a class of vehicle routing problems under time and demand uncertainty
  Anand Subramanian, Carlos Neves, Pedro Munari

MD-19: Combinatorial Optimization in Logistics, Supply Chains, and Quantum Computing Applications
Stream: Combinatorial Optimization
Room: FENH105 (building FEN-UChile)
Chair(s): Fred Glover, Gary Kochenberger

• Quadratic Unconstrained Binary Optimization (QUBO) Approach for Supply Chain Applications
  Haitao Li, Gary Kochenberger, Fred Glover
• Resource-constrained multi-stage machining and assembly scheduling with sequential and batch processes
  Yu Du, Yang Wang
• Innovative approaches to optimal production scheduling in highly complex, real-world settings
  Marco Better
• Applied Quadratic Unconstrained Binary Optimization (QUBO) Formulations of Common Machine Learning Algorithms
  Anna Hughes, Gary Kochenberger, Fred Glover

ME-19: Vehicle Routing
Stream: Combinatorial Optimization
Room: FENH105 (building FEN-UChile)
Chair(s): Gustavo Gatica

• A heuristic method for the close enough traveling salesman problem
  Ernesto G. Birgin, Paula C. R. Ertel
• A multi-phase methodology for solving distribution problems with limited supply at the depots
  Pedro Piñeyro, Javier de Prado, Sandro Moscatelli, Libertad Tansini, Omar Viera
• Vehicle routing problem with backhauls, time windows and stochastic demand
  Gustavo Gatica, Daniela Quila, Daniel Morillo Torres, Rodrigo Linfati, jairo Coronado-Hernandez
• Exact Separation of Rounded Capacity Inequalities for the Capacitated Vehicle Routing Problem
  Konstantin Pavlikov, Niels Christian Petersen

TB-19: Mathematical Models and Metaheuristics for Combinatorial Optimization Problems
Stream: Combinatorial Optimization
Room: FENH105 (building FEN-UChile)
Chair(s): Paolo Toth

• Metaheuristic Algorithm Based on Tabu Search for Consistent Vehicle Routing Problem
  Rodrigo Linfati, Lucas Barros-Lebanek , Esteban Santana-Contreras, John Willmer Escobar
• Optimizing Forest Harvest Planning Using Mathematical Model and Two-Phase Evolutionary Computation Algorithms
  Carlos Rey, Simón Sandoval, Guillermo Cabrera, Diego Seco, Zheng Li, Pierluigi Cerulo
• A two-level Hybrid Metaheuristic to Solve the Quota Travelling Salesman Problem with Passengers, Incomplete Ride and Collection Time Optimization
  Reinier Fernandez Lopez, Carlos Contreras-Bolton, Rosa Medina, Lorena Pradenas
• Systematic Conservation Planning with Multiple MIP Models for Addressing Spatially Complex Conservation Problems
  Eduardo Álvarez-Miranda, José Salgado-Rojas, Virgilio Hermoso

TB-20: Knapsack and Packing Problems
Stream: Combinatorial Optimization
Room: FENH106 (building FEN-UChile)
Chair(s): Stefano Novellani

• An integer linear programming formulation for the cutting stock problem with due date
  Kelly Cristina Poldi, Daniel Schulmeister
• A lifting heuristic for probabilistic cover inequalities based on the non-convex continuous relaxation for the chance-constrained binary knapsack problem
  Junyoung Kim, Kyungsik Lee
• The k-Best Solutions of the 0-1 Knapsack Problem Algorithms and Applications
  Stefano Novellani, Marco Antonio Boschetti

TD-19: Discrete Modelling
Stream: Combinatorial Optimization
Room: FENH105 (building FEN-UChile)
Chair(s): Jan van Vuuren

• An investigation into deep generative models for optimisation problem solution initialisation
  Stephan Nel
• A generic framework for modelling customer invoice payment predictions
  Willem Moore
• Using Linear Reformulations to Explain Solvable Cases of the Quadratic Assignment Problem
  Lucas Waddell
• A Fitness Landscape-integrated Metaheuristic Selection Framework for Optimisation Problems
  Jan van Vuuren, Nathan van der Westhuyzen

TD-20: Optimization Models and Exact Methods Applied to Vehicle Routing Problems
Stream: Combinatorial Optimization
Room: FENH106 (building FEN-UChile)
Chair(s): Alejandro Arenas, Gulnara Baldoquin, Juan Carlos Rivera

• Effect of formulations over a Periodic Capacitated Vehicle Routing Problem with Multiple Depots, Heterogeneous Fleet, and hard Time-Windows
  Alejandro Arenas, Juan Carlos Rivera, Gulnara Baldoquin
• An Integer Programming Model for Heterogeneous Team Orientation Problem with Split Delivery of Renewable Resources and Time Windows: Protest mitigation application
  Juan Antonio Martinez Becerra, Santiago Barriga Jama, Daniel Morillo Torres, Gustavo Gatica
• The Periodic Capacitated Clustering Problem
  Marcos José Negreiros

TE-19: Discrete, Continuous or Stochastic Optimization and Control in Networks, Transportation and Design
Stream: Combinatorial Optimization
Room: FENH105 (building FEN-UChile)
Chair(s): Gerhard-Wilhelm Weber, Thomas Weber

• Exploring integer programming techniques for the hyper-rectangular clustering problem with axis-parallel clusters
  Javier Marenco, Diego Delle Donne
• Valid inequalities for the robust multi-agent pathfinding problem
  Seyoung Oh, Kyungsik Lee
• Planning the Daily Shift Assignment for the Medical and Paramedical Personnel at a Hospital
  Luis Moreno, Javier Diaz

HB-19: Optimization Approaches for Freight Distribution Problems
Stream: Combinatorial Optimization
Room: FENH105 (building FEN-UChile)
Chair(s): Claudia Archetti

• A branch-and-price approach for last-mile deliveries with capacitated robot stations
  Diego Delle Donne, Yerlan Kuzbakov, Laurent Alfandari
• Approximation of the Double Traveling Salesman Problem with Multiple Stacks
  Laurent Alfandari, Sophie Toulouse
• A pricing and routing bilevel problem for last-mile delivery
  Claudia Archetti, Martina Cerulli, Elena Fernandez, Ivana Ljubic

HB-20: Topics in Combinatorial Optimization
Stream: Combinatorial Optimization
Room: FENH106 (building FEN-UChile)
Chair(s): Juan José Salazar González

• Manufacture of flower bouquets using Mathematical Optimization
  Karen Acosta, Andres Miniguano-Trujillo, Diego Recalde, Juan Pablo Dueñas
• Wayki: a web-based experimentation platform to support research on hard optimization problems
  Roberto Asín, Julio Godoy, Rosa Medina, Federico Meza, Pedro Pinacho
• A heuristic approach for selecting objects to observe in Astronomy
  Juan José Salazar González

HD-20: Combinatorial Optimization
Stream: Combinatorial Optimization
Room: FENH106 (building FEN-UChile)
Chair(s): Monique Guignard-Spielberg

• Models for the 2D cutting stock problem in the honeycomb cardboard industry
  Antonio Alonso-Ayuso, Paula Terán Viadero, F. Javier Martin-Campo
• Models for the Euclidean Steiner tree problem in d-space (d>=3)
  Nelson Maculan, Renan Pinto, Hacène Ouzia
• Some MIP algorithms may be strengthened by adding intermediate improving steps
  Monique Guignard-Spielberg

HE-19: Last Mile Delivery Optimization
Stream: Combinatorial Optimization
Room: FENH105 (building FEN-UChile)
Chair(s): Alfredo Candia-Véjar

• Hybrid algorithms for real-time delivery systems in the gig economy
  Karla Hoffman, Carolyn Mooney
• An exact cutting plane method for the Euclidean max-sum diversity problem
  Sandy Spiers
• On models and algorithms for the Pickup to Delivery Drone Routing problem
  Alfredo Candia-Véjar, Javier Gómez Lagos, Benjamín Rojas

HE-20: Design and Evaluation of Approximations
Stream: Combinatorial Optimization
Room: FENH106 (building FEN-UChile)
Chair(s): Bo Chen

• Joint replenishment meets scheduling
  Péter Györgyi, Tamas Kis, Timea Tamasi, József Békési
• Fairness Criteria for Allocating Indivisible Chores: Connections and Efficiencies
  Bo Chen, Ankang Sun, Xuan Vinh Doan

FA-19: Urban Transportation Problems
Stream: Combinatorial Optimization
Room: FENH105 (building FEN-UChile)
Chair(s): Antonio Mauttone

• A multioperator genetic algorithm for the traveling salesman problem with job-times
  pablo gutierrez, Lorena Pradenas, Carlos Contreras-Bolton
• A multi-layer network design model for planning bicycle infrastructure
  Antonio Mauttone, Gabriel Bayá, Franco Robledo
• A stochastic MILP approach for cross-docking platforms design and management
  M. Araceli Garin, Laureano F. Escudero, Aitziber Unzueta

FA-20: Scheduling Problems
Stream: Combinatorial Optimization
Room: FENH106 (building FEN-UChile)
Chair(s): Horacio Yanasse

• A B&P procedure for a Concurrent Open Shop Problem
  Emiliano Lancini, Michele Barbato, Diego Delle Donne
• Selecting and scheduling research projects in Antarctica considering environmental effects
  Mauricio Vega-Hidalgo, Lorena Pradenas, Víctor Parada
• Improved lower bound for a job sequencing and minimization of tool switches problem
  Horacio Yanasse

FB-19: Models and Algorithms for Routing and Scheduling Problems
Stream: Combinatorial Optimization
Room: FENH105 (building FEN-UChile)
Chair(s): Juan José Miranda Bront

• Routing of electrical vehicles over steep streets
  Emilio García, Luis Torres, Sandra Gutierrez, Diego Recalde, Fernanda Salazar, Ramiro Torres
• Decremental State-Space Relaxations for the Basic Traveling Salesman Problem with a Drone
  Francisco Soulignac, Marcos Blufstein, Gonzalo Lera Romero
• Rescheduling the NBA regular season via Integer Programming
  Nicolas Garcia Aramouni, Juan José Miranda Bront

FB-20: Graph Problems
Stream: Combinatorial Optimization
Room: FENH106 (building FEN-UChile)
Chair(s): Gustavo Angulo

• A Branch & Cut Algorithm for a New Coloring Problem
  Sebastián Taboh, Isabel Méndez-Díaz, Paula Zabala
• A novel three-level matheuristic for the Capacitated Minimum Spanning Tree Problem with Time Windows
  Pablo Reyes-Polanco, Lorena Pradenas, Carlos Contreras-Bolton
• Generalized formulations for the traveling salesman problem
  Gustavo Angulo, Diego Moran