Facility location problems on graphs with non-convex neighborhoods
From MaRDI portal
Publication:6047916
DOI10.1016/j.cor.2023.106356MaRDI QIDQ6047916
No author found.
Publication date: 13 September 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Double bound method for solving the \(p\)-center location problem
- Heuristics for a continuous multi-facility location problem with demand regions
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- On the structure of the solution set for the single facility location problem with average distances
- The single facility location problem with average-distances
- Applications of second-order cone programming
- Approximation algorithms for the Geometric Covering Salesman Problem
- Second-order cone programming
- A novel discretization scheme for the close enough traveling salesman problem
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
- An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions
- Integer programming formulations for the minimum weighted maximal matching problem
- Routing for unmanned aerial vehicles: touring dimensional sets
- Minimum cost \(b\)-matching problems with neighborhoods
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances
- On minimum- and maximum-weight minimum spanning trees with neighborhoods
- Ordered \(p\)-median problems with neighbourhoods
- Upgrading edges in the maximal covering location problem
- A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem
- A New Formulation and Resolution Method for the p-Center Problem
- Touring a sequence of polygons
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Approximation algorithms for TSP with neighborhoods in the plane
- The generalized Weber problem with expected distances
- The travelling salesman problem with neighbourhoods: MINLP solution
- Minimum Spanning Tree with Neighborhoods
- An Approach to Location Models Involving Sets as Existing Facilities
- TSP with neighborhoods of varying size
- Locating facilities by minimax relative to closest points of demand areas
- Results for the close-enough traveling salesman problem with a branch-and-bound algorithm
- The generalized close enough traveling salesman problem
This page was built for publication: Facility location problems on graphs with non-convex neighborhoods
