Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities
From MaRDI portal
Publication:5470776
DOI10.1137/S0895480103439157zbMath1122.90098OpenAlexW2002322315MaRDI QIDQ5470776
Publication date: 1 June 2006
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480103439157
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)
Related Items (6)
Skyport location problem for urban air mobility system ⋮ A specialized branch \& bound \& cut for single-allocation ordered median hub location problems ⋮ Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem ⋮ Star \(p\)-hub median problem with modular arc capacities ⋮ Network hub location problems: The state of the art ⋮ Single-allocation ordered median hub location problems
This page was built for publication: Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities