Nonlinear optimization simplified by hypersurface deformation.

DOI10.1007/BF01011658zbMath1084.90039OpenAlexW2044336609MaRDI QIDQ1963544

Frank H. Stillinger, Thomas A. Weber

Publication date: 2 February 2000

Published in: Journal of Statistical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01011658

zbMATH Keywords

simulated annealingNonlinear optimizationgraph partitioningglobal minimairregular graphsant-lion methodhypersurface deformation

Mathematics Subject Classification ID

Nonlinear programming (90C30) Combinatorial optimization (90C27) Graph theory (05C99)

Related Items (4)

On the neighborhood structure of the traveling salesman problem generated by local search moves ⋮ An optimization approach to the problem of protein structure prediction ⋮ A smoothing method of global optimization that preserves global minima ⋮ Method to solve the travelling salesman problem using the inverse of diffusion process

Cites Work

• Optimization by Simulated Annealing
• Unnamed Item

This page was built for publication: Nonlinear optimization simplified by hypersurface deformation.