An exact solution procedure for a cluster hub location problem

DOI10.1016/j.ejor.2006.02.011zbMath1107.90029OpenAlexW2060604985MaRDI QIDQ859914

Bernd Wagner

Publication date: 22 January 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.02.011

zbMATH Keywords

integer programmingNP-hardhub location problem

Mathematics Subject Classification ID

Integer programming (90C10) Continuous location (90B85)

Related Items (5)

An efficient model for the multiple allocation hub maximal covering problem ⋮ Allocation strategies in hub networks ⋮ A multiobjective hub-airport location problem for an airline network design ⋮ Network hub location problems: The state of the art ⋮ Modeling congestion and service time in hub location problems

Cites Work

• Unnamed Item
• Unnamed Item
• A clustering approach to the planar hub location problem
• A quadratic integer program for the location of interacting hub facilities
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Constraint satisfaction problems: Algorithms and applications
• A Dual-Based Procedure for Uncapacitated Facility Location
• A dual algorithm for the uncapacitated hub location problem
• Dual-based approach for a hub network design problem under non-restrictive policy
• HubLocator: An exact solution method for the multiple allocation hub location problem

This page was built for publication: An exact solution procedure for a cluster hub location problem