Solving a capacitated hub location problem
From MaRDI portal
Publication:2384615
DOI10.1016/J.EJOR.2006.11.026zbMATH Open1149.90317OpenAlexW2084435746MaRDI QIDQ2384615FDOQ2384615
Authors: Inmaculada Rodríguez-Martín, Juan-José Salazar-González 
Publication date: 10 October 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.2006.11.026
Recommendations
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Solution algorithms for the capacitated single allocation hub location problem
- Formulating and solving splittable capacitated multiple allocation hub location problems
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Benders decomposition algorithms for two variants of the single allocation hub location problem
network designBenders decompositionbranch-and-cut algorithmtelecommunicationcapacitated hub location problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Discrete location and assignment (90B80)
Cites Work
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Partitioning procedures for solving mixed-variables programming problems
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- 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
- Dioïds and semirings: Links to fuzzy sets and other applications
- HubLocator: An exact solution method for the multiple allocation hub location problem
- Adapting polyhedral properties from facility to hub location problems
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Hub network design with single and multiple allocation: A computational study
- Network Design Using Cut Inequalities
- A survey on Benders decomposition applied to fixed-charge network design problems
- Tailoring Benders decomposition for uncapacitated network design
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Designing cost-effective content distribution networks
- Benders-and-cut algorithm for fixed-charge capacitated network design problem
- Exact solution of multicommodity network optimization problems with general step cost functions
- A generalization of max flow—min cut
- A decomposition approach for an equipment selection and multiple product routing problem incorporating environmental factors
- Exact solution methods for uncapacitated location problems with convex transportation costs
- A demand-shifting feasibility algorithm for Benders decomposition.
Cited In (28)
- Allocating nodes to hubs for minimizing the hubs processing resources: A case study
- Multiple allocation hub-and-spoke network design under hub congestion
- An efficient model for the multiple allocation hub maximal covering problem
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Multimodal freight transportation planning: a literature review
- A linear program for the two-hub location problem
- A decomposition approach for single allocation hub location problems with multiple capacity levels
- Single-allocation ordered median hub location problems
- A capacitated hub location problem under hose demand uncertainty
- Alternate second order conic program reformulations for hub location under stochastic demand and congestion
- A branch‐and‐cut algorithm for hub network design problems with profits
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Solution algorithms for the capacitated single allocation hub location problem
- Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- A branch and cut algorithm for hub location problems with single assignment
- A conditional \(p\)-hub location problem with attraction functions
- Formulating and solving splittable capacitated multiple allocation hub location problems
- Solution of preemptive multi-objective network design problems applying Benders decomposition method
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- Solution approaches to hub location problems
- The hub location and routing problem
- Solving the hub location problem with modular link capacities
- Matheuristics for optimizing the network in German wagonload traffic
- Branch and price for large-scale capacitated hub location problems with single assignment
- Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
- The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
This page was built for publication: Solving a capacitated hub location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2384615)
