An exact algorithm for the service network design problem with hub capacity constraints

DOI10.1002/net.22128zbMath1528.90109MaRDI QIDQ6085889

Nemhauser, George I., Savelsbergh, Martin W. P., Edward He, Natashia Boland

Publication date: 12 December 2023

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

time discretizationiterative refinementservice network designsame-day deliverydynamic discretization discoverytime-expanded networkshub capacity

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)

Cites Work

• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
• A time indexed formulation of non-preemptive single machine scheduling problems
• Efficient continuous-time dynamic network flow algorithms
• Service network design in freight transportation
• Perspectives on integer programming for time-dependent models
• Multicommodity flows over time: Efficient algorithms and complexity
• Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
• The Continuous-Time Service Network Design Problem
• Multimodal Express Package Delivery: A Service Network Design Application
• Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
• Constructing Maximal Dynamic Flows from Static Flows
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design