Incremental optimization of hub and spoke network for the spokes' numbers and flow
From MaRDI portal
Publication:1666325
DOI10.1155/2015/682402zbMath1394.90164OpenAlexW2118520089WikidataQ59118914 ScholiaQ59118914MaRDI QIDQ1666325
Publication date: 27 August 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/682402
Cites Work
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- Hub and spoke network design with single-assignment, capacity decisions and balancing requirements
- Adapting polyhedral properties from facility to hub location problems
- Tight bounds from a path based formulation for the tree of hub location problem
- The capacitated single-allocation hub location problem revisited: a note on a classical formulation
- Preprocessing and cutting for multiple allocation hub location problems.
- A branch and cut algorithm for hub location problems with single assignment
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
- Formulating and solving splittable capacitated multiple allocation hub location problems
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- ON THE HUB-AND-SPOKE MODEL WITH ARC CAPACITY CONATRAINTS
- Hub network design with single and multiple allocation: A computational study
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
This page was built for publication: Incremental optimization of hub and spoke network for the spokes' numbers and flow
