On hub location problems in geographically flexible networks
From MaRDI portal
Publication:6071054
DOI10.1111/itor.12993arXiv2001.11230OpenAlexW3164932125MaRDI QIDQ6071054
Publication date: 27 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.11230
Cites Work
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- Solving the uncapacitated hub location problem using genetic algorithms
- Single-allocation ordered median hub location problems
- Tight bounds from a path based formulation for the tree of hub location problem
- Largest and smallest convex hulls for imprecise points
- The tree of hubs location problem
- A quadratic integer program for the location of interacting hub facilities
- Solution approaches to hub location problems
- The hub location and routing problem
- A hybrid heuristic for the uncapacitated hub location problem
- Upgrading nodes in tree-shaped hub location
- A novel discretization scheme for the close enough traveling salesman problem
- An exact algorithm for the modular hub location problem with single assignments
- Heuristics for the capacitated modular hub location problem
- A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
- Covering problems with polyellipsoids: a location analysis perspective
- Perspectives on modeling hub location problems
- Routing for unmanned aerial vehicles: touring dimensional sets
- Modeling congestion and service time in hub location problems
- On minimum- and maximum-weight minimum spanning trees with neighborhoods
- Ordered \(p\)-median problems with neighbourhoods
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- Network hub location problems: The state of the art
- Projecting the flow variables for hub location problems
- Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods
- On the Location of Hub Facilities
- Interacting New Facilities and Location-Allocation Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- The travelling salesman problem with neighbourhoods: MINLP solution
- Models and solution methods for the uncapacitated r‐allocation p‐hub equitable center problem
This page was built for publication: On hub location problems in geographically flexible networks
