Mechanisms for local search (Q1266572)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Mechanisms for local search	scientific article

Statements

scholarly article

0 references

Mechanisms for local search (English)

0 references

European Journal of Operational Research

0 references

publication date

7 October 1998

0 references

zbMATH Keywords

local search methods

0 references

travelling salesman problem

0 references

quadratic assignment

0 references

Edward J. Anderson

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0377-2217(94)00164-2

0 references

A thermodynamically motivated simulation procedure for combinatorial optimization problems

0 references

Structural analysis of local search heuristics in combinatorial optimization

0 references

0 references

Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning

0 references

A probabilistic analysis of the switching algorithm for the Euclidean TSP

0 references

An Effective Heuristic Algorithm for the Traveling-Salesman Problem

0 references

Eigenvalues, diameter, and mean distance in graphs

0 references

0 references

Efficient simulated annealing on fractal energy landscapes

0 references

Hill Climbing with Multiple Local Optima

0 references

A new approach to choosing initial points in local search

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0377-2217(94)00164-2

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1266572

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1266572&oldid=34207922"