Flow shipment scheduling in an incomplete hub location-routing network design problem
From MaRDI portal
Publication:725702
DOI10.1007/s40314-016-0368-yzbMath1397.90178OpenAlexW2503538622MaRDI QIDQ725702
Publication date: 2 August 2018
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-016-0368-y
Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items (2)
Location‐routing problem: a classification of recent research ⋮ Adjustable robust balanced hub location problem with uncertain transportation cost
Cites Work
- Unnamed Item
- A branch-and-cut algorithm for the partitioning-hub location-routing problem
- Hub location for time definite transportation
- Tight bounds from a path based formulation for the tree of hub location problem
- A quadratic integer program for the location of interacting hub facilities
- Integer programming formulations of discrete hub location problems
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- LTL logistics networks with differentiated services
- Proprietor and customer costs in the incomplete hub location-routing network topology
- Topological design of a two-level network with ring-star configuration
- Network hub location problems: The state of the art
- Release Time Scheduling and Hub Location for Next-Day Delivery
- Solving the Hub location problem in telecommunication network design: A local search approach
- A hub covering model for cargo delivery systems
- The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
- Optimal empty vehicle redistribution for hub‐and‐spoke transportation systems
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- A Benders Decomposition for Hub Location Problems Arising in Public Transport
- Network design for time‐constrained delivery
- Dual-based approach for a hub network design problem under non-restrictive policy
This page was built for publication: Flow shipment scheduling in an incomplete hub location-routing network design problem
