Solving a capacitated hub location problem

DOI10.1016/J.EJOR.2006.11.026MaRDI QIDQ2384615zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

network designBenders decompositionbranch-and-cut algorithmtelecommunicationcapacitated hub location problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18) Discrete location and assignment (90B80)

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

Cites work

• A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
• A decomposition approach for an equipment selection and multiple product routing problem incorporating environmental factors
• A demand-shifting feasibility algorithm for Benders decomposition.
• A generalization of max flow—min cut
• A survey on Benders decomposition applied to fixed-charge network design problems
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Adapting polyhedral properties from facility to hub location problems
• Benders-and-cut algorithm for fixed-charge capacitated network design problem
• Designing cost-effective content distribution networks
• Dioïds and semirings: Links to fuzzy sets and other applications
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Exact solution methods for uncapacitated location problems with convex transportation costs
• Exact solution of multicommodity network optimization problems with general step cost functions
• Hub network design with single and multiple allocation: A computational study
• HubLocator: An exact solution method for the multiple allocation hub location problem
• Integer programming formulations of discrete hub location problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Network Design Using Cut Inequalities
• Partitioning procedures for solving mixed-variables programming problems
• Tailoring Benders decomposition for uncapacitated network design
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• Tight linear programming relaxations of uncapacitated p-hub median problems
• Variable neighborhood search
• Variable neighborhood search: Principles and applications

Cited in

(28)

• The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
• Allocating nodes to hubs for minimizing the hubs processing resources: A case study
• Multiple allocation hub-and-spoke network design under hub congestion
• Benders decomposition for the uncapacitated multiple allocation hub location problem
• An efficient model for the multiple allocation hub maximal covering 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
• Lagrangean relaxation for the capacitated hub location problem with single assignment
• Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
• 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
• Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
• Branch and price for large-scale capacitated hub location problems with single assignment

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)