Branch-and-refine for solving time-expanded MILP formulations

DOI10.1016/j.cor.2022.106043OpenAlexW4303520765MaRDI QIDQ2108138

Fabian Gnegel, Armin Fügenschuh

Publication date: 19 December 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.106043

zbMATH Keywords

branch-and-boundtraveling salesman problem with time windowsgraph refinementshortest path problem with time windows

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem
• Layered graph approaches for combinatorial optimization problems
• Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
• The precedence-constrained asymmetric traveling salesman polytope
• Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
• Beam-ACO for the travelling salesman problem with time windows
• An iterative graph expansion approach for the scheduling and routing of airplanes
• Solving network design problems via iterative aggregation
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
• An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
• A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
• A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
• An Introduction to Network Flows over Time
• On a routing problem
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• Computational Integer Programming and Cutting Planes
• Solution of a Large-Scale Traveling-Salesman Problem

This page was built for publication: Branch-and-refine for solving time-expanded MILP formulations