Pages that link to "Item:Q5749151"
From MaRDI portal
The following pages link to Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space (Q5749151):
Displaying 17 items.
- Optimal random matchings, tours, and spanning trees in hierarchically separated trees (Q388460) (← links)
- On the connectivity threshold for general uniform metric spaces (Q656572) (← links)
- On common edges in optimal solutions to traveling salesman and other optimization problems (Q1105496) (← links)
- Quantizers ad the worst case Euclidean traveling salesman problem (Q1111946) (← links)
- Worst case asymptotics for some classical optimization problems (Q1375702) (← links)
- On approximately fair cost allocation in Euclidean TSP games (Q1384221) (← links)
- Probability theory of classical Euclidean optimization problems (Q1385435) (← links)
- Asymptotic properties of combinatorial optimization problems in \(p\)-adic space (Q1760265) (← links)
- Routing heuristics for automated pick and place machines (Q1806942) (← links)
- Asymptotics for the Euclidean TSP with power weighted edges (Q1893902) (← links)
- Smoothed analysis of partitioning algorithms for Euclidean functionals (Q1950395) (← links)
- Rates of convergence of means of Euclidean functionals (Q2471129) (← links)
- Ergodic theorems for some classical problems in combinatorial optimization (Q2564700) (← links)
- Vehicle Routing Algorithms for Radially Escaping Targets (Q2949981) (← links)
- On some approximately balanced combinatorial cooperative games (Q3142154) (← links)
- The minimal spanning tree and the upper box dimension (Q3372096) (← links)
- Entropic repulsion of 3D Ising interfaces conditioned to stay above a floor (Q6137376) (← links)
