The tree of hubs location problem

DOI10.1016/j.ejor.2009.05.044zbMath1175.90396OpenAlexW2042959366MaRDI QIDQ1039782

Elena Fernández, Alfredo Marín, Iván A. Contreras

Publication date: 23 November 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.05.044

zbMATH Keywords

valid inequalitiesspanning treeshub location

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (56)

Hub location problems with price sensitive demands ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ Upgrading nodes in tree-shaped hub location ⋮ The \(p\)-arborescence star problem: formulations and exact solution approaches ⋮ Multi-product capacitated single-allocation hub location problems: formulations and inequalities ⋮ Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network ⋮ Hybrid search for the optimal PMU placement problem on a power grid ⋮ Exact and heuristic algorithms for the design of hub networks with multiple lines ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ A two-level off-grid electric distribution problem on the continuous space ⋮ A branch-and-cut algorithm for the hub location and routing problem ⋮ Routing and scheduling decisions in the hierarchical hub location problem ⋮ \(p\)-hub median problem for non-complete networks ⋮ Hub Location as the Minimization of a Supermodular Set Function ⋮ Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region ⋮ Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems ⋮ A biased random-key genetic algorithm for the tree of hubs location problem ⋮ Multiple allocation tree of hubs location problem for non-complete networks ⋮ General network design: a unified view of combined location and network design problems ⋮ Lagrangean bounds for the optimum communication spanning tree problem ⋮ Hub location problem considering spoke links with incentive-dependent capacities ⋮ Exact and heuristic approaches for the cycle hub location problem ⋮ A branch‐and‐cut algorithm for hub network design problems with profits ⋮ On hub location problems in geographically flexible networks ⋮ An efficient model for the multiple allocation hub maximal covering problem ⋮ Configuration‐based approach for topological problems in the design of wireless sensor networks ⋮ A non-triangular hub location problem ⋮ Integrated multi-level intermodal network design problem: a sustainable approach, based on competition of rail and road transportation systems ⋮ Allocation strategies in hub networks ⋮ A new formulation and branch-and-cut method for single-allocation hub location problems ⋮ Stochastic uncapacitated hub location ⋮ Tree network design avoiding congestion ⋮ Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems ⋮ Hub and spoke network design with single-assignment, capacity decisions and balancing requirements ⋮ HUBBI: iterative network design for incomplete hub location problems ⋮ New Valid Inequalities for the Optimal Communication Spanning Tree Problem ⋮ Median and covering location problems with interconnected facilities ⋮ A hybrid firefly-genetic algorithm for the capacitated facility location problem ⋮ Multi-period hub network design problems with modular capacities ⋮ Solving the optimum communication spanning tree problem ⋮ Proprietor and customer costs in the incomplete hub location-routing network topology ⋮ Exact solution of hub network design problems with profits ⋮ Multiple allocation hub interdiction and protection problems: model formulations and solution approaches ⋮ Less is more: general variable neighborhood search for the capacitated modular hub location problem ⋮ Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths ⋮ MIP models for connected facility location: a theoretical and computational study ⋮ Alternate solution approaches for competitive hub location problems ⋮ Perspectives on modeling hub location problems ⋮ The capacitated directed cycle hub location and routing problem under congestion ⋮ A new formulation and an exact approach for the many-to-many hub location-routing problem ⋮ On carriers collaboration in hub location problems ⋮ Design of a reliable logistics network with hub disruption under uncertainty ⋮ Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints ⋮ Modeling congestion and service time in hub location problems ⋮ A bi-objective incomplete hub location-routing problem with flow shipment scheduling ⋮ A competitive hub location and pricing problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adapting polyhedral properties from facility to hub location problems
• Heuristics for the p-hub location problem
• Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
• New formulations for the uncapacitated multiple allocation hub location problem
• Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
• An extension to rapid transit network design problem
• Lagrangean relaxation for the capacitated hub location problem with single assignment
• A quadratic integer program for the location of interacting hub facilities
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Solution algorithms for the capacitated single allocation hub location problem
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Integer programming formulations of discrete hub location problems
• Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
• Preprocessing and cutting for multiple allocation hub location problems.
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• A branch and cut algorithm for hub location problems with single assignment
• Locating tree-shaped facilities using the ordered median objective
• Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
• Formulating and solving splittable capacitated multiple allocation hub location problems
• Network hub location problems: The state of the art
• A new relaxation method for the generalized minimum spanning tree problem
• Hub Arc Location Problems: Part I—Introduction and Results
• Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
• On locating path- or tree-shaped facilities on networks
• Optimum Communication Spanning Trees
• Locating a cycle in a transportation or a telecommunications network
• The complexity of the network design problem
• A dual algorithm for the uncapacitated hub location problem
• A hub location problem in designing digital data service networks: Lagrangian relaxation approach
• An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
• A Benders Decomposition for Hub Location Problems Arising in Public Transport
• Network design for time‐constrained delivery
• HubLocator: An exact solution method for the multiple allocation hub location problem

This page was built for publication: The tree of hubs location problem