Upgrading nodes in tree-shaped hub location
From MaRDI portal
Publication:1628119
DOI10.1016/j.cor.2018.10.007zbMath1458.90414arXiv1802.05252OpenAlexW2963527389WikidataQ129114360 ScholiaQ129114360MaRDI QIDQ1628119
Publication date: 3 December 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.05252
Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (8)
A two-level off-grid electric distribution problem on the continuous space ⋮ Planning and design of intermodal hub networks: a literature review ⋮ Multiple allocation tree of hubs location problem for non-complete networks ⋮ Upgrading edges in the maximal covering location problem ⋮ Upgrading edges in the graphical TSP ⋮ The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation ⋮ On hub location problems in geographically flexible networks ⋮ A branch-and-price approach for the continuous multifacility monotone ordered median problem
Cites Work
- Unnamed Item
- Tree network design avoiding congestion
- MIP models for connected facility location: a theoretical and computational study
- Tight bounds from a path based formulation for the tree of hub location problem
- The tree of hubs location problem
- 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
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
- \(p\)-hub median problem for non-complete networks
- Upgrading the 1-center problem with edge length variables on a tree
- A biased random-key genetic algorithm for the tree of hubs location problem
- Exact and heuristic approaches for the cycle hub location problem
- An improved Benders decomposition algorithm for the tree of hubs location problem
- Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints
- Network hub location problems: The state of the art
- Upgrading Shortest Paths in Networks
- Hub Arc Location Problems: Part I—Introduction and Results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Hub network design with single and multiple allocation: A computational study
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Network upgrading problems
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
- Improving Minimum Cost Spanning Trees by Upgrading Nodes
- Integer Programming: Methods, Uses, Computations
- The Location of Emergency Service Facilities
This page was built for publication: Upgrading nodes in tree-shaped hub location
