50 citations
- Centre National de la Recherche ScientifiqueFR12 papers
- Nantes UniversitéFR9 papers
- Laboratoire de Physique Subatomique et des Technologies AssociéesFR8 papers
- Université Paris CitéFR7 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR6 papers
- Aix-Marseille UniversitéFR5 papers
- Institut des Hautes Études ScientifiquesFR5 papers
- Istituto Nazionale di Fisica Nucleare, Sezione di BolognaIT5 papers
- Jagiellonian UniversityPL5 papers
- Le Mans UniversitéFR5 papers
- Lyon 1 UniversitéFR5 papers
- Observatoire de la Côte d’AzurFR5 papers
4 papers · 1 filter
Arc-consistency with linear programming reduced costs (applied to stable set in chordal graphs)
Guillaume Claus, Hadrien Cambazard, Hugo Apeloig +1
A well known technique to reduce the search space in integer programming is known as variable fixing or reduced cost strengthening. The reduced costs given by an optimal dual solut…
Branch \& Price \& Cut for the Time-Dependent Vehicle Routing Problem with Time Windows (TDVRPTW)
Florian Rascoussier, Romain Billot, Lina Fahed +1
In urban contexts, travel times vary strongly with the time of day and traffic conditions. The Time-Dependent Vehicle Routing Problem with Time Windows (TDVRPTW) extends the classi…
Randomized Constructive Heuristics for the VRPTW: A Focus on Regret-k
Florian Rascoussier, Romain Billot, Lina Fahed +1
The Vehicle Routing Problem with Time Windows (VRPTW) requires a fleet of capacitated vehicles to serve customers within strict time windows while minimizing total travel time. Con…
Impact of Scaling and Rounding on Metaheuristic Performance for the Vehicle Routing Problem with Time Windows
Florian Rascoussier, Romain Billot, Lina Fahed +1
Classical Euclidean instances for the Vehicle Routing Problem with Time Windows (VRPTW) have floating-point arc costs derived from node coordinates. This raises reproducibility and…