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

DOI10.1016/J.COR.2022.106043MaRDI QIDQ2108138zbMATH OpenOpenAlexFDO

Authors Fabian Gnegel, Armin Fügenschuh

Publication date 19 December 2022

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• Dynamic graph generation for the shortest path problem in time expanded networks
• Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
• An enhanced lower bound for the time-dependent travelling salesman problem
• Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
• scientific article; zbMATH DE number 947471

Cites work

• scientific article; zbMATH DE number 4019237 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• A compressed-annealing heuristic for the traveling salesman problem with time windows
• A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem
• A generalized insertion heuristic for the travelling salesman problem with time windows
• A note on two problems in connexion with graphs
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• A time bucket formulation for the traveling salesman problem with time windows
• An exact constraint logic programming algorithm for the traveling salesman problem with time windows
• An introduction to network flows over time
• An iterative graph expansion approach for the scheduling and routing of airplanes
• Beam-ACO for the travelling salesman problem with time windows
• Branch-and-price: Column generation for solving huge integer programs
• Computational Integer Programming and Cutting Planes
• Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
• Layered graph approaches for combinatorial optimization problems
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• On a routing problem
• Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
• Solution of a Large-Scale Traveling-Salesman Problem
• Solving network design problems via iterative aggregation
• Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
• The precedence-constrained asymmetric traveling salesman polytope

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108138)