The single-assignment hub covering problem: Models and linearizations

DOI10.1057/PALGRAVE.JORS.2601473MaRDI QIDQ4678126zbMATH OpenOpenAlexFDO

Authors Bahar Y. Kara, B. Tansel

Publication date 23 May 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11693/24539

zbMATH Keywords

combinatorial problemshub coverhub locationinteger programminglocation

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10) Combinatorial optimization (90C27)

Recommendations

• Model formulations for hub covering problems
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks
• Integer programming formulations of discrete hub location problems
• On the single-assignment \(p\)-hub center problem
• A hub covering network design problem for cargo applications in Turkey

Cited in

(25)

• On the single-assignment \(p\)-hub center problem
• A tabu search heuristic for the uncapacitated single 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
• LTL logistics networks with differentiated services
• Hub-and-spoke network design with congestion
• A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming
• Proprietor and customer costs in the incomplete hub location-routing network topology
• Multi-period hub set covering problems with flexible radius: a modified genetic solution
• A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
• Network hub location problems: The state of the art
• Hub location under competition
• Model formulations for hub covering problems
• An M/M/c queue model for hub covering location problem
• An efficient genetic algorithm for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
• Hub location problems: the location of interacting facilities
• 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
• Some new clique inequalities in four-index hub location models
• Single-allocation ordered median hub location problems
• Hub interdiction problem variants: models and metaheuristic solution algorithms
• Developing an integrated model of hierarchical hub location and inventory control for perishable products in urban and rural areas: a case study in food supply chain
• A tabu-search based heuristic for the hub covering problem over incomplete hub networks
• Path relinking approach for multiple allocation hub maximal covering problem

This page was built for publication: The single-assignment hub covering problem: Models and linearizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4678126)