Model formulations for hub covering problems
From MaRDI portal
Publication:3519364
DOI10.1057/palgrave.jors.2602424zbMath1144.90340OpenAlexW2029947651MaRDI QIDQ3519364
No author found.
Publication date: 14 August 2008
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602424
Related Items (16)
Endogenous effects of hubbing on flow intensities ⋮ Multimodal freight transportation planning: a literature review ⋮ A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem ⋮ An efficient model for the multiple allocation hub maximal covering problem ⋮ Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems ⋮ Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem ⋮ A specialized branch \& bound \& cut for single-allocation ordered median hub location problems ⋮ Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths ⋮ Generalized coverage: new developments in covering location models ⋮ Single-allocation ordered median hub location problems ⋮ Hub interdiction problem variants: models and metaheuristic solution algorithms ⋮ Multi-period hub set covering problems with flexible radius: a modified genetic solution ⋮ A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming ⋮ Modeling congestion and service time in hub location problems ⋮ An efficient genetic algorithm for the Uncapacitated r-allocation p-hub maximal covering problem ⋮ Designing a hub location and pricing network in a competitive environment
This page was built for publication: Model formulations for hub covering problems
