Adapting polyhedral properties from facility to hub location problems

DOI10.1016/J.DAM.2003.09.011zbMath1058.90033OpenAlexW2024503399MaRDI QIDQ705504

Stefan Nickel, Tim Sonneborn, Martine Labbé, Horst W. Hamacher

Publication date: 31 January 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.09.011

zbMATH Keywords

Facility locationInteger programmingFacetHub locationValid inequality

Mathematics Subject Classification ID

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

Related Items (43)

New formulations for the uncapacitated multiple allocation hub location problem ⋮ Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing ⋮ Multiple allocation hub-and-spoke network design under hub congestion ⋮ A conditional \(p\)-hub location problem with attraction functions ⋮ Aggregation in hub location problems ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ A capacitated hub location problem in freight logistics multimodal networks ⋮ Competitive multiple allocation hub location problem considering primary and backup routes ⋮ Solving the continuous multiple allocationp-hub median problem by the hyperbolic smoothing approach ⋮ Solving a capacitated hub location problem ⋮ A capacitated hub location problem under hose demand uncertainty ⋮ Exact approaches for static data segment allocation problem in an information network ⋮ An exact algorithm for the modular hub location problem with single assignments ⋮ An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty ⋮ Incremental optimization of hub and spoke network for the spokes' numbers and flow ⋮ 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 ⋮ Design of intermodal logistics networks with hub delays ⋮ Exact and heuristic approaches for the cycle hub location problem ⋮ A non-triangular hub location problem ⋮ 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 ⋮ Stochastic uncapacitated hub location ⋮ A specialized branch \& bound \& cut for single-allocation ordered median hub location problems ⋮ The planar hub location problem: a probabilistic clustering approach ⋮ Star \(p\)-hub median problem with modular arc capacities ⋮ Multiple allocation hub interdiction and protection problems: model formulations and solution approaches ⋮ A fuzzy programming approach for dynamic virtual hub location problem ⋮ Network hub location problems: The state of the art ⋮ Single-allocation ordered median hub location problems ⋮ The hub location problem with market selection ⋮ Alternate solution approaches for competitive hub location problems ⋮ Perspectives on modeling hub location problems ⋮ Optimal-transport satisficing with applications to capacitated hub location ⋮ A study of the quadratic semi-assignment polytope ⋮ Uncapacitated single and multiple allocation \(p\)-hub center problems ⋮ GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS ⋮ Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems ⋮ The tree of hubs location problem ⋮ Hub Location Problems: The Location of Interacting Facilities ⋮ A competitive hub location and pricing problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A quadratic integer program for the location of interacting hub facilities
• Geometric algorithms and combinatorial optimization
• A linear program for the two-hub location problem
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Integer programming formulations of discrete hub location problems
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• The simple plant location problem: Survey and synthesis
• On the facets of the simple plant location packing polytope
• On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
• On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
• Fractional vertices, cuts and facets of the simple plant location problem
• Some facets of the simple plant location polytope
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• The single allocation problem in the interacting three-hub network
• On the facial structure of set packing polyhedra
• On the Two-Level Uncapacitated Facility Location Problem
• New facets for the set packing polytope

This page was built for publication: Adapting polyhedral properties from facility to hub location problems