Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space
From MaRDI portal
Publication:5749151
DOI10.1287/moor.15.4.749zbMath0717.90060OpenAlexW2107102056MaRDI QIDQ5749151
Publication date: 1990
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.15.4.749
surveyasymptotic behaviortraveling salesmanminimal triangulationminimal spanning treeminimal matchingsubadditive Euclidean functionalsworst case analysesgreedy matchingK-medianprobabilistic assumptions
Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Asymptotics for the Euclidean TSP with power weighted edges ⋮ Quantizers ad the worst case Euclidean traveling salesman problem ⋮ On approximately fair cost allocation in Euclidean TSP games ⋮ Vehicle Routing Algorithms for Radially Escaping Targets ⋮ Entropic repulsion of 3D Ising interfaces conditioned to stay above a floor ⋮ On the connectivity threshold for general uniform metric spaces ⋮ Rates of convergence of means of Euclidean functionals ⋮ The minimal spanning tree and the upper box dimension ⋮ Routing heuristics for automated pick and place machines ⋮ On some approximately balanced combinatorial cooperative games
