The single-assignment hub covering problem: Models and linearizations
From MaRDI portal
Publication:4678126
DOI10.1057/palgrave.jors.2601473zbMath1088.90035OpenAlexW2088616082MaRDI QIDQ4678126
Barbaros C. Tansel, Bahar Yetis Kara
Publication date: 23 May 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/24539
Integer programming (90C10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (19)
A tabu-search based heuristic for the hub covering problem over incomplete hub networks ⋮ Hub location under competition ⋮ A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem ⋮ An efficient model for the multiple allocation hub maximal covering problem ⋮ An \(M/M/c\) queue model for hub covering location problem ⋮ Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems ⋮ A specialized branch \& bound \& cut for single-allocation ordered median hub location problems ⋮ Proprietor and customer costs in the incomplete hub location-routing network topology ⋮ Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths ⋮ LTL logistics networks with differentiated services ⋮ Network hub location problems: The state of the art ⋮ Hub-and-spoke network design with congestion ⋮ Path relinking approach for multiple allocation hub maximal covering problem ⋮ 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 ⋮ An efficient genetic algorithm for the Uncapacitated r-allocation p-hub maximal covering problem ⋮ Hub Location Problems: The Location of Interacting Facilities
This page was built for publication: The single-assignment hub covering problem: Models and linearizations
