Adapting polyhedral properties from facility to hub location problems
From MaRDI portal
Publication:705504
DOI10.1016/J.DAM.2003.09.011zbMATH Open1058.90033OpenAlexW2024503399MaRDI QIDQ705504FDOQ705504
Authors: Horst W. Hamacher, Martine Labbé, S. Nickel, Tim Sonneborn 
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
Recommendations
- Projecting the flow variables for hub location problems
- Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities
- New facets for the two-stage uncapacitated facility location polytope
- New formulations for the uncapacitated multiple allocation hub location problem
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
Cites Work
- Geometric algorithms and combinatorial optimization
- Title not available (Why is that?)
- 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
- Integer programming formulations of discrete hub location problems
- Title not available (Why is that?)
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- On the facial structure of set packing polyhedra
- Title not available (Why is that?)
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Hub location problems in urban traffic networks
- The single allocation problem in the interacting three-hub network
- The simple plant location problem: Survey and synthesis
- On the Two-Level Uncapacitated Facility Location Problem
- On the facets of the simple plant location packing polytope
- New facets for the set packing polytope
- A linear program for the two-hub location problem
- 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
Cited In (45)
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- Optimal-transport satisficing with applications to capacitated hub location
- Star \(p\)-hub median problem with modular arc capacities
- Allocation strategies in hub networks
- Stochastic uncapacitated hub location
- Polyhedral Analysis for the Uncapacitated Hub Location Problem with Modular Arc Capacities
- Alternate solution approaches for competitive hub location problems
- New formulations for the uncapacitated multiple allocation hub location problem
- Multiple allocation hub-and-spoke network design under hub congestion
- The tree of hubs location problem
- Incremental optimization of hub and spoke network for the spokes' numbers and flow
- Multiple allocation hub interdiction and protection problems: model formulations and solution approaches
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- Single-allocation ordered median hub location problems
- Competitive multiple allocation hub location problem considering primary and backup routes
- The hub location problem with market selection
- Hub location problems: the location of interacting facilities
- 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
- A capacitated hub location problem under hose demand uncertainty
- The planar hub location problem: a probabilistic clustering approach
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
- A non-triangular hub location problem
- 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
- A competitive hub location and pricing problem
- Network hub location problems: The state of the art
- Exact approaches for static data segment allocation problem in an information network
- A conditional \(p\)-hub location problem with attraction functions
- A study of the quadratic semi-assignment polytope
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Design of intermodal logistics networks with hub delays
- GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS
- Aggregation in hub location problems
- Exact and heuristic approaches for the cycle hub location problem
- Solving the continuous multiple allocation \(p\)-hub median problem by the hyperbolic smoothing approach
- Hub location as the minimization of a supermodular set function
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- Solving a capacitated hub location problem
- Multiple allocation hub location with service level constraints for two shipment classes
- A capacitated hub location problem in freight logistics multimodal networks
- Projecting the flow variables for hub location problems
- Perspectives on modeling hub location problems
- A fuzzy programming approach for dynamic virtual hub location problem
- A new formulation and branch-and-cut method for single-allocation hub location problems
This page was built for publication: Adapting polyhedral properties from facility to hub location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705504)
