New formulations for the uncapacitated multiple allocation hub location problem

DOI10.1016/j.ejor.2004.09.047zbMath1116.90071MaRDI QIDQ818098

Lázaro Cánovas, Mercedes Landete, Alfredo Marín

Publication date: 24 March 2006

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

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

zbMATH Keywords

integer programming; intersection graph; set packing; hub location

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C10: Integer programming

90B80: Discrete location and assignment

Related Items

Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique, Uncapacitated single and multiple allocation \(p\)-hub center problems, Network hub location problems: The state of the art

Cites Work

• Unnamed Item
• Unnamed Item
• Adapting polyhedral properties from facility to hub location problems
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Weber problems with alternative transportation systems
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Integer programming formulations of discrete hub location problems
• Hub network design with single and multiple allocation: A computational study
• A dual algorithm for the uncapacitated hub location problem
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
• Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
• On the facial structure of set packing polyhedra
• New facets for the set packing polytope
• HubLocator: An exact solution method for the multiple allocation hub location problem