scientific article; zbMATH DE number 3193293
From MaRDI portal
zbMath0118.35601MaRDI QIDQ5729634
J. M. Hammersley, Jillian Beardwood, John H. Halton
Publication date: 1959
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Asymptotics for weighted minimal spanning trees on random points, Asymptotics for Voronoi tessellations on random samples, Probabilistic exchange algorithms and Euclidean traveling salesman problems, A parallel tabu search algorithm for large traveling salesman problems, A fast optimization method based on a hierarchical strategy for the travelling salesman problem, Law of large numbers for the drift of the two-dimensional wreath product, Reconstruction of polycrystalline structures: a new application of combinatorial optimization, Vertex ordering and partitioning problems for random spatial graphs., Total distance approximations for routing solutions, Asymptotic and finite size parameters for phase transitions: Hamiltonian circuit as a case study, Euclidean travelling salesman problem with location-dependent and power-weighted edges, Distributionally robust mixed integer linear programs: persistency models with applications, Principal curves of oriented points: theoretical and computational improvements, On the quadratic random matching problem in two-dimensional domains, The travelling salesman problem with pick-up and delivery, Boundary effects in the traveling salesperson problem, Asymptotics for transportation cost in high dimensions, New primal and dual matching heuristics, Asymptotics for the Euclidean TSP with power weighted edges, Heuristics and bounds for the travelling salesman location problem on the plane, A distribution-free TSP tour length estimation model for random graphs, Territory design for the multi-period vehicle routing problem with time windows, Dynamic design of sales territories, Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks, Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs, Dynamic pooled capacity deployment for urban parcel logistics, Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm, Technical note: the expected length of an orderly path, On properties of geometric random problems in the plane, Quantizers ad the worst case Euclidean traveling salesman problem, Almost subadditive multiparameter ergodic theorems, Asymptotics for Euclidean functionals with power-weighted edges, Solving large-scale TSP using a fast wedging insertion partitioning approach, Two queues with non-stochastic arrivals, Worst case asymptotics for some classical optimization problems, Divide and conquer strategies for parallel TSP heuristics, Submodularity and the traveling salesman problem, Constructive quantization: approximation by empirical measures, A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution, On the greedy walk problem, On global integer extrema of real-valued box-constrained multivariate quadratic functions, Random restricted matching and lower bounds for combinatorial optimization, A concise guide to existing and emerging vehicle routing problem variants, Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms, The TSP phase transition, The Euclidean traveling salesman problem and a space-filling curve, On minimal trajectories for mobile sampling of bandlimited fields, Continuous approximation models in freight distribution management, Rejoinder on: continuous approximation models in freight distribution management, Computing the variance of tour costs over the solution space of the TSP in polynomial time, Estimation of more than one parameters in stratified sampling with fixed budget, Multi-objective compromise allocation in multivariate stratified sampling using extended lexicographic goal programming with gamma cost function, Discrete extremal problems, Replica symmetry of the minimum matching, The expected length of a random line segment in a rectangle., Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations, An O(N log N) planar travelling salesman heuristic based on spacefilling curves, The physicist's approach to the travelling salesman problem. II, An appraisal of computational complexity for operations researchers, A non-linear dimension reduction methodology for generating data-driven stochastic input models, A primer of the Euclidean Steiner problem, Estimating the asymptotic constant of the total length of Euclidean minimal spanning trees with power-weighted edges., The dynamic-demand joint replenishment problem with approximated transportation costs, Euclidean semi-matchings of random samples, Solution approaches for the stochastic capacitated traveling salesmen location problem with recourse, Minimum spanning trees of random geometric graphs with location dependent weights, Worst-case minimum rectilinear Steiner trees in all dimensions, Intrinsic dimension estimation: advances and open problems, Scaling laws for maximum coloring of random geometric graphs, Worst-case demand distributions in vehicle routing, On the long edges in the shortest tour through \(n\) random points, Asymptotics for Euclidean minimal spanning trees on random points, Stacks, queues, and deques with order-statistic operations, Operational estimators for the length of a traveling salesman tour, An on-demand same-day delivery service using direct peer-to-peer transshipment strategies, Bounds for the traveling salesman paths of two-dimensional modular lattices, A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms, A new lower bound for the geometric traveling salesman problem in terms of discrepancy, The dynamic dispatch waves problem for same-day delivery, Modeling multiscale diffusion processes in random heterogeneous media, On the solutions of stochastic traveling salesman problems, Geometry of the minimal spanning tree of a random 3-regular graph, An empirical study of tests for uniformity in multidimensional data, A stochastic multiscale framework for modeling flow through random heterogeneous porous media, Designing multi-vehicle delivery tours in a grid-cell format, Harry Kesten's work in probability theory, An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability, The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees, Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem, A stochastic and dynamic routing policy using branching processes with state dependent immigration, Asymptotic expected performance of some TSP heuristics: An empirical evaluation, A continuous approach to the design of physical distribution systems, Limit theory of combinatorial optimization for random geometric graphs, Estimating the Held-Karp lower bound for the geometric TSP, Application of the noising method to the travelling salesman problem, Asymptotics for the length of a minimal triangulation on a random sample, An effective implementation of the Lin-Kernighan traveling salesman heuristic, Asymptotic of power-weighted Euclidean functionals, Rate of convergence for the Euclidean minimum spanning tree limit law, A two-phase tabu search approach to the location routing problem, Sustainability SI: logistics cost and environmental impact analyses of urban delivery consolidation strategies, Generating subtour elimination constraints for the TSP from pure integer solutions, An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search, A tabu search experience in production scheduling, Further results on the probabilistic traveling salesman problem, Planning and approximation models for delivery route based services with price-sensitive demands, Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points, The Random QUBO, Average optimal cost for the Euclidean TSP in one dimension, A New Approach for Vehicle Routing with Stochastic Demand: Combining Route Assignment with Process Flexibility, A survey on combinatorial optimization in dynamic environments, Practical distribution-sensitive point location in triangulations, Euclidean matching problems and the metropolis algorithm, Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), Unnamed Item, An efficient heuristic algorithm for minimum matching, Optimal Cheeger cuts and bisections of random geometric graphs, Limit Theorems in Discrete Stochastic Geometry, On the Lengths of Curves Passing Through Boundary Points of a Planar Convex Shape, Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations, A concentration inequality for the facility location problem, Optimal TSP tour length estimation using standard deviation as a predictor, An approximation of the customer waiting time for online restaurants owning delivery system, Directions for future research on urban mobility and city logistics, Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach, Complexity of inventory routing problems when routing is easy, Optimal TSP tour length estimation using Sammon maps, Using regression models to understand the impact of route-length variability in practical vehicle routing, Iterated tour partitioning for Euclidean capacitated vehicle routing, Continuous approximation formulas for location problems, Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery, Fuzzy multi-objective optimization for optimum allocation in multivariate stratified sampling with quadratic cost and parabolic fuzzy numbers, Smart and sustainable city logistics: design, consolidation, and regulation, Household-Level Economies of Scale in Transportation, Convergence rate for geometric statistics of point processes having fast decay of dependence, Unnamed Item, Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics, Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes, Optimal transport methods for combinatorial optimization over two random point sets, Minimum Cost Matching in a Random Graph with Random Costs, Bounds for Random Binary Quadratic Programs, Evolution of Athletic Records: Statistical Effects versus Real Improvements, Compromise allocation in multivariate stratified sample surveys under two stage randomized response model, Wasserstein Distance and the Distributionally Robust TSP, The Vehicle Routing Problem with Release and Due Dates, Randomized near-neighbor graphs, giant components and applications in data science, The stable marriage problem: an interdisciplinary review from the physicist's perspective, Light Euclidean Spanners with Steiner Points, On estimating the distribution of optimal traveling salesman tour lengths using heuristics, Designing multi-tier, multi-service-level, and multi-modal last-mile distribution networks for omni-channel operations, Rates of convergence of means of Euclidean functionals, On the history of the Euclidean Steiner tree problem, Sigma-delta quantization errors and the traveling salesman problem, Approximating the length of Chinese postman tours, Approximation algorithms for the Euclidean bipartite TSP, A probabilistic analysis of the multi-period single-sourcing problem, Traveling salesman problem across well-connected cities and with location-dependent edge lengths, Almost sure asymptotic optimality for online routing and machine scheduling problems, Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems, Statistical mechanics methods and phase transitions in optimization problems, Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem, Degree bounded bottleneck spanning trees in three dimensions, An improved lower bound for the traveling salesman constant, Dividing a Territory Among Several Vehicles, The snake for visualizing and for counting clusters in multivariate data, Multi-objective geometric programming approach in multivariate stratified sample survey with quadratic cost function, On a random directed spanning tree, Minimum Scan Cover with Angular Transition Costs, Ergodic theorems for some classical problems in combinatorial optimization, New Bounds for the Traveling Salesman Constant, Comments on: continuous approximation models in freight distribution management, Estimation of finite population mean in multivariate stratified sampling under cost function using goal programming, Hamiltonian completions of sparse random graphs, Combinatorial Optimization Over Two Random Point Sets, Probabilistic Analysis of Geometric Location Problems
