Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique

DOI10.1016/j.ejor.2005.08.028zbMath1163.90595OpenAlexW2147439713MaRDI QIDQ864018

Lázaro Cánovas, Sergio García, Alfredo Marín

Publication date: 12 February 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.2005.08.028

zbMATH Keywords

integer programminglocationhub locationdual-ascent technique

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (21)

Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing ⋮ A tabu-search based heuristic for the hub covering problem over incomplete hub networks ⋮ A conditional \(p\)-hub location problem with attraction functions ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ A capacitated hub location problem under hose demand uncertainty ⋮ When centers can fail: a close second opportunity ⋮ New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem ⋮ Hub location problem considering spoke links with incentive-dependent capacities ⋮ A non-triangular hub location problem ⋮ Multiple allocation hub location with service level constraints for two shipment classes ⋮ Allocation strategies in hub networks ⋮ Stochastic uncapacitated hub location ⋮ Matheuristics for optimizing the network in German wagonload traffic ⋮ A specialized branch \& bound \& cut for single-allocation ordered median hub location problems ⋮ Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem ⋮ Network hub location problems: The state of the art ⋮ The uncapacitated hub location problem in networks under decentralized management ⋮ Single-allocation ordered median hub location problems ⋮ Perspectives on modeling hub location problems ⋮ Uncapacitated single and multiple allocation \(p\)-hub center problems ⋮ The tree of hubs location problem

Uses Software

• XPRESS

Cites Work

• New formulations for the uncapacitated multiple allocation hub location problem
• A quadratic integer program for the location of interacting hub facilities
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Solution algorithms for the capacitated single allocation hub location problem
• Integer programming formulations of discrete hub location problems
• Preprocessing and cutting for multiple allocation hub location problems.
• A Dual-Based Procedure for Uncapacitated Facility Location
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• A dual algorithm for the uncapacitated hub location problem
• HubLocator: An exact solution method for the multiple allocation hub location problem

This page was built for publication: Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique