Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm

DOI10.1007/s10898-004-6099-4zbMath1093.90022OpenAlexW2088700598MaRDI QIDQ811891

Alfredo Marín

Publication date: 23 January 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-6099-4

zbMATH Keywords

Lagrangian relaxationFacetsHub locationSet packing

Mathematics Subject Classification ID

Continuous location (90B85) Nonlinear programming (90C30)

Related Items

Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing ⋮ A capacitated hub location problem under hose demand uncertainty ⋮ Exact approaches for static data segment allocation problem in an information network ⋮ Hub Location as the Minimization of a Supermodular Set Function ⋮ General network design: a unified view of combined location and network design problems ⋮ New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem ⋮ The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation ⋮ Multiple allocation hub location with service level constraints for two shipment classes ⋮ Allocation strategies in hub networks ⋮ A new formulation and branch-and-cut method for single-allocation hub location problems ⋮ A specialized branch \& bound \& cut for single-allocation ordered median hub location problems ⋮ Network hub location problems: The state of the art ⋮ Single-allocation ordered median hub location problems ⋮ Perspectives on modeling hub location problems ⋮ Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution ⋮ Uncapacitated single and multiple allocation \(p\)-hub center problems ⋮ The tree of hubs location problem ⋮ Hub Location Problems: The Location of Interacting Facilities

Cites Work

• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Efficient cuts in Lagrangean `relax-and-cut' schemes
• Integer programming formulations of discrete hub location problems
• Preprocessing and cutting for multiple allocation hub location problems.
• On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
• 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
• Properties of vertex packing and independence system polyhedra
• On the facial structure of set packing polyhedra
• HubLocator: An exact solution method for the multiple allocation hub location problem