Tight bounds from a path based formulation for the tree of hub location problem
From MaRDI portal
Publication:833527
DOI10.1016/j.cor.2008.12.009zbMath1176.90351OpenAlexW2076515248MaRDI QIDQ833527
Alfredo Marín, Iván A. Contreras, Elena Fernández
Publication date: 14 August 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.12.009
Related Items (33)
Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ Upgrading nodes in tree-shaped hub location ⋮ Multi-product capacitated single-allocation hub location problems: formulations and inequalities ⋮ Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem ⋮ Exact and heuristic algorithms for the design of hub networks with multiple lines ⋮ A two-level off-grid electric distribution problem on the continuous space ⋮ Looking for edge-equitable spanning trees ⋮ An exact algorithm for the modular hub location problem with single assignments ⋮ Routing and scheduling decisions in the hierarchical hub location problem ⋮ Incremental optimization of hub and spoke network for the spokes' numbers and flow ⋮ Hub Location as the Minimization of a Supermodular Set Function ⋮ 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 ⋮ On hub location problems in geographically flexible networks ⋮ Decomposition methods based on articulation vertices for degree-dependent spanning tree problems ⋮ Integrated multi-level intermodal network design problem: a sustainable approach, based on competition of rail and road transportation systems ⋮ Tree network design avoiding congestion ⋮ Approximation Algorithm for Cycle-Star Hub Network Design Problems and Cycle-Metric Labeling Problems ⋮ HUBBI: iterative network design for incomplete hub location problems ⋮ New Valid Inequalities for the Optimal Communication Spanning Tree Problem ⋮ Solving the optimum communication spanning tree problem ⋮ Proprietor and customer costs in the incomplete hub location-routing network topology ⋮ 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 ⋮ Perspectives on modeling hub location problems ⋮ The capacitated directed cycle hub location and routing problem under congestion ⋮ Flow shipment scheduling in an incomplete hub location-routing network design problem ⋮ Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- An extension to rapid transit network design problem
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Solution algorithms for the capacitated single allocation hub location problem
- Integer programming formulations of discrete hub location problems
- Locating tree-shaped facilities using the ordered median objective
- Lagrangean relaxation. (With comments and rejoinder).
- Approximation algorithms for the optimal \(p\)-source communication spanning tree
- Formulating and solving splittable capacitated multiple allocation hub location problems
- 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 Ring Star Problem: Polyhedral analysis and exact algorithm
- A Benders Decomposition for Hub Location Problems Arising in Public Transport
- Network design for time‐constrained delivery
This page was built for publication: Tight bounds from a path based formulation for the tree of hub location problem
