scientific article; zbMATH DE number 3193293
From MaRDI portal
Publication:5729634
Cited in
(only showing first 100 items - show all)- A stochastic multiscale framework for modeling flow through random heterogeneous porous media
- Probabilistic exchange algorithms and Euclidean traveling salesman problems
- Reconstruction of polycrystalline structures: a new application of combinatorial optimization
- Heuristics and bounds for the travelling salesman location problem on the plane
- Quantizers ad the worst case Euclidean traveling salesman problem
- Almost subadditive multiparameter ergodic theorems
- Submodularity and the traveling salesman problem
- Discrete extremal problems
- Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
- An O(N log N) planar travelling salesman heuristic based on spacefilling curves
- An appraisal of computational complexity for operations researchers
- A primer of the Euclidean Steiner problem
- Euclidean semi-matchings of random samples
- Worst-case minimum rectilinear Steiner trees in all dimensions
- 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
- On the solutions of stochastic traveling salesman problems
- A stochastic and dynamic routing policy using branching processes with state dependent immigration
- Estimating the Held-Karp lower bound for the geometric TSP
- Asymptotics for the length of a minimal triangulation on a random sample
- Rate of convergence for the Euclidean minimum spanning tree limit law
- A parallel tabu search algorithm for large traveling salesman problems
- A fast optimization method based on a hierarchical strategy for the travelling salesman problem
- The travelling salesman problem with pick-up and delivery
- Boundary effects in the traveling salesperson problem
- Asymptotics for transportation cost in high dimensions
- Worst case asymptotics for some classical optimization problems
- Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms
- The TSP phase transition
- The Euclidean traveling salesman problem and a space-filling curve
- The expected length of a random line segment in a rectangle.
- A continuous approach to the design of physical distribution systems
- Application of the noising method to the travelling salesman problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Asymptotic of power-weighted Euclidean functionals
- A two-phase tabu search approach to the location routing problem
- Asymptotics for weighted minimal spanning trees on random points
- Asymptotics for Voronoi tessellations on random samples
- Total distance approximations for routing solutions
- Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs
- Solving large-scale TSP using a fast wedging insertion partitioning approach
- Two queues with non-stochastic arrivals
- On global integer extrema of real-valued box-constrained multivariate quadratic functions
- Continuous approximation models in freight distribution management
- Rejoinder on: continuous approximation models in freight distribution management
- The dynamic-demand joint replenishment problem with approximated transportation costs
- Intrinsic dimension estimation: advances and open problems
- Worst-case demand distributions in vehicle routing
- A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms
- An empirical study of tests for uniformity in multidimensional data
- Designing multi-vehicle delivery tours in a grid-cell format
- The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees
- Asymptotic expected performance of some TSP heuristics: An empirical evaluation
- Vertex ordering and partitioning problems for random spatial graphs.
- Principal curves of oriented points: theoretical and computational improvements
- New primal and dual matching heuristics
- Asymptotics for the Euclidean TSP with power weighted edges
- Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
- On properties of geometric random problems in the plane
- Asymptotics for Euclidean functionals with power-weighted edges
- Divide and conquer strategies for parallel TSP heuristics
- Random restricted matching and lower bounds for combinatorial optimization
- 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
- Estimating the asymptotic constant of the total length of Euclidean minimal spanning trees with power-weighted edges.
- Minimum spanning trees of random geometric graphs with location dependent weights
- 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
- Geometry of the minimal spanning tree of a random 3-regular graph
- Harry Kesten's work in probability theory
- Limit theory of combinatorial optimization for random geometric graphs
- Law of large numbers for the drift of the two-dimensional wreath product
- Euclidean travelling salesman problem with location-dependent and power-weighted edges
- On the quadratic random matching problem in two-dimensional domains
- Territory design for the multi-period vehicle routing problem with time windows
- Dynamic pooled capacity deployment for urban parcel logistics
- Technical note: the expected length of an orderly path
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution
- A concise guide to existing and emerging vehicle routing problem variants
- The stable marriage problem: an interdisciplinary review from the physicist's perspective
- Designing multi-tier, multi-service-level, and multi-modal last-mile distribution networks for omni-channel operations
- On the history of the Euclidean Steiner tree problem
- Approximating the length of Chinese postman tours
- Traveling salesman problem across well-connected cities and with location-dependent edge lengths
- Degree bounded bottleneck spanning trees in three dimensions
- An improved lower bound for the traveling salesman constant
- Estimation of finite population mean in multivariate stratified sampling under cost function using goal programming
- 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
- An approximation of the customer waiting time for online restaurants owning delivery system
- Compromise allocation in multivariate stratified sample surveys under two stage randomized response model
- On estimating the distribution of optimal traveling salesman tour lengths using heuristics
- Rates of convergence of means of Euclidean functionals
- Sigma-delta quantization errors and the traveling salesman problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5729634)