Model formulations for hub covering problems
From MaRDI portal
Publication:3519364
Recommendations
- The single-assignment hub covering problem: Models and linearizations
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- Integer programming formulations of discrete hub location problems
- A hub covering network design problem for cargo applications in Turkey
- An efficient model for the multiple allocation hub maximal covering problem
Cited in
(21)- A general variable neighborhood search for solving the uncapacitated r-allocation p-hub maximal covering problem
- Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems
- Star p-hub center problem and star p-hub median problem with bounded path lengths
- A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming
- Multi-period hub set covering problems with flexible radius: a modified genetic solution
- Modeling congestion and service time in hub location problems
- Endogenous effects of hubbing on flow intensities
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- Mathematical formulations and solution methods for the uncapacitated r-allocation p-hub maximal covering problem
- Multimodal freight transportation planning: a literature review
- A hub covering network design problem for cargo applications in Turkey
- The single-assignment hub covering problem: Models and linearizations
- An efficient genetic algorithm for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- An efficient model for the multiple allocation hub maximal covering problem
- Hub location with congestion and time-sensitive demand
- General variable neighborhood search for the capacitated single allocation hub maximal covering problem
- An exact method for trilevel hub location problem with interdiction
- Single-allocation ordered median hub location problems
- Hub interdiction problem variants: models and metaheuristic solution algorithms
- Designing a hub location and pricing network in a competitive environment
- Generalized coverage: new developments in covering location models
This page was built for publication: Model formulations for hub covering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519364)
