Pages that link to "Item:Q3727741"
From MaRDI portal
The following pages link to Euclidean matching problems and the metropolis algorithm (Q3727741):
Displaying 14 items.
- A quantization framework for smoothed analysis of Euclidean optimization problems (Q893320) (← links)
- Methods for the one-dimensional space allocation problem (Q916571) (← links)
- Reconstruction of polycrystalline structures: a new application of combinatorial optimization (Q1086259) (← links)
- A simulated annealing approach to the multiconstraint zero-one knapsack problem (Q1099588) (← links)
- On the Euclidean assignment problem (Q1108932) (← links)
- Quantizers ad the worst case Euclidean traveling salesman problem (Q1111946) (← links)
- An efficient matching algorithm applied in statistical physics (Q1331902) (← links)
- Applying tabu search with influential diversification to multiprocessor scheduling (Q1342105) (← links)
- New primal and dual matching heuristics (Q1891231) (← links)
- Convergence of asymptotic costs for random Euclidean matching problems (Q2139532) (← links)
- Euclidean random matching in 2D for non-constant densities (Q2659292) (← links)
- A concentration inequality for the facility location problem (Q2670506) (← links)
- The Euclidean Matching Problem (Q2822804) (← links)
- An efficient heuristic algorithm for minimum matching (Q3202140) (← links)