Euclidean matching problems and the metropolis algorithm
From MaRDI portal
Publication:3727741
DOI10.1007/BF01919172zbMath0595.90060OpenAlexW2036918449MaRDI QIDQ3727741
Publication date: 1986
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01919172
simulated annealingasymptotic behaviourcomputational resultsgeometric probabilityrandomly generated problemseuclidean combinatorial optimizationlarge-scale Euclidean matching
Numerical mathematical programming methods (65K05) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Reconstruction of polycrystalline structures: a new application of combinatorial optimization, Applying tabu search with influential diversification to multiprocessor scheduling, New primal and dual matching heuristics, A simulated annealing approach to the multiconstraint zero-one knapsack problem, On the Euclidean assignment problem, Quantizers ad the worst case Euclidean traveling salesman problem, An efficient heuristic algorithm for minimum matching, A concentration inequality for the facility location problem, A quantization framework for smoothed analysis of Euclidean optimization problems, Methods for the one-dimensional space allocation problem
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Partitioning heuristics for two geometric maximization problems
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- Subadditive Euclidean functionals and nonlinear growth in geometric probability
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Cooling Schedules for Optimal Annealing
- Heuristics for planar minimum‐weight perfect metchings
- Paths, Trees, and Flowers
