Continuous approximation formulas for location problems
From MaRDI portal
Publication:6085881
DOI10.1002/NET.22099zbMath1528.90134OpenAlexW4225113747WikidataQ113913602 ScholiaQ113913602MaRDI QIDQ6085881
Bo Jones, John Gunnar Carlsson
Publication date: 12 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22099
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A distribution-free TSP tour length estimation model for random graphs
- Shortest path through random points
- Cube versus torus models and the Euclidean minimum spanning tree constant
- On optimal matchings
- Growth rates of Euclidean minimal spanning trees with power weighted edges
- The minimum spanning tree constant in geometrical probability and under the independent model: A unified approach
- Asymptotics for Euclidean minimal spanning trees on random points
- A probabilistic analysis of the capacitated facility location problem
- Rate of convergence of power-weighted Euclidean minimal spanning trees
- Asymptotics for weighted minimal spanning trees on random points
- Weak laws of large numbers in geometric probability
- Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
- An improved lower bound for the traveling salesman constant
- The prize-collecting generalized minimum spanning tree problem
- A multiplicatively-weighted Voronoi diagram approach to logistics districting
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- Heuristic Search for the Generalized Minimum Spanning Tree Problem
- Household-Level Economies of Scale in Transportation
- An Approximation Algorithm for the Continuous k-Medians Problem in a Convex Polygon
- Almost sure asymptotic optimality for online routing and machine scheduling problems
- A Probabilistic Analysis of the K-Location Problem
- The shortest path and the shortest road through n points
- Solution methods for thep-median problem: An annotated bibliography
- THE AVERAGE DISTANCE BETWEEN TWO POINTS
- Probabilistic analysis of a network design problem heuristic
- Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location
- Probabilistic Analysis of the Planar k-Median Problem
- The complexity of the capacitated tree problem
- Steinhaus's geometric location problem for random samples in the plane
- Complete Convergence of the Directed TSP
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- A statistical approach to the tsp
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
- Worst-case incremental analysis for a class ofp-facility location problems
- Probabilistic analysis of an lp relaxation bound for the steiner problem in networks
- Solving the Continuous p-Dispersion Problem Using Non-linear Programming
- On the generalized minimum spanning tree problem
- Asymptotics for geometric location problems over random samples
- An average case analysis of the minimum spanning tree heuristic for the power assignment problem
- New Bounds for the Traveling Salesman Constant
- Expected Distances between Two Uniformly Distributed Random Points in Rectangles and Rectangular Parallelpipeds
- On the Continuous Fermat-Weber Problem
- Bounding Distributions for the Weight of a Minimum Spanning Tree in Stochastic Networks
- Upper and Lower Bounds for Stochastic Processes
- Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
- An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search
This page was built for publication: Continuous approximation formulas for location problems
