An Asymptotic, Probabilistic Analysis of a Routing Problem
From MaRDI portal
Publication:4165119
DOI10.1287/moor.3.2.89zbMath0384.90054OpenAlexW2083391552MaRDI QIDQ4165119
Publication date: 1978
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.3.2.89
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Geometric probability and stochastic geometry (60D05) Deterministic scheduling theory in operations research (90B35) Strong limit theorems (60F15)
Related Items
Total distance approximations for routing solutions ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks ⋮ A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives ⋮ A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution ⋮ Continuous approximation models in freight distribution management ⋮ Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics ⋮ Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations ⋮ The physicist's approach to the travelling salesman problem. II ⋮ A tabu search heuristic for the dynamic transportation of patients between care units ⋮ Designing multi-vehicle delivery tours in a grid-cell format ⋮ Discrete online TSP ⋮ A continuous approach to the design of physical distribution systems ⋮ Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints ⋮ k-interchange procedures for local search in a precedence-constrained routing problem
