4 citations · 8 across the 6 of their papers we have counts for
7 papers
On the integration of Dantzig-Wolfe and Fenchel decompositions via directional normalizations
François Lamothe, Alain Haït, Emmanuel Rachelson +2
The strengthening of linear relaxations and bounds of mixed integer linear programs has been an active research topic for decades. Enumeration-based methods for integer programming…
Efficient labeling algorithms for adjacent quadratic shortest paths
João Vilela, Bruno Fanzeres, Rafael Martinelli +1
In this article, we study the Adjacent Quadratic Shortest Path Problem (AQSPP), which consists in finding the shortest path on a directed graph when its total weight component also…
On the optimal layout of a dining room in the era of COVID-19 using mathematical optimization
Claudio Contardo, Luciano Costa
We consider the problem of maximizing the number of people that a dining room can accommodate provided that the chairs belonging to different tables are socially distant. We introd…
Multi-Robot Routing with Time Windows: A Column Generation Approach
Naveed Haghani, Jiaoyang Li, Sven Koenig +4
Robots performing tasks in warehouses provide the first example of wide-spread adoption of autonomous vehicles in transportation and logistics. The efficiency of these operations,…
Integer Programming for Multi-Robot Planning: A Column Generation Approach
Naveed Haghani, Jiaoyang Li, Sven Koenig +3
We consider the problem of coordinating a fleet of robots in a warehouse so as to maximize the reward achieved within a time limit while respecting problem and robot specific const…
Relaxed Dual Optimal Inequalities for Relaxed Columns: with Application to Vehicle Routing
Naveed Haghani, Claudio Contardo, Julian Yarkony
We address the problem of accelerating column generation for set cover problems in which we relax the state space of the columns to do efficient pricing. We achieve this by adaptin…
Smooth and flexible dual optimal inequalities
Naveed Haghani, Claudio Contardo, Julian Yarkony
We address the problem of accelerating column generation (CG) for set-covering formulations via dual optimal inequalities (DOI). DOI use knowledge of the dual solution space to der…