Nonlinear optimization simplified by hypersurface deformation.

DOI10.1007/BF01011658zbMATH Open1084.90039OpenAlexW2044336609MaRDI QIDQ1963544FDOQ1963544

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

Recommendations

• Nature's way of optimizing
• Deformation method of investigation of nonlinear programming problems. II
• Deformation method of investigation of nonlinear programming problems. I
• Optimization by simulated annealing
• scientific article; zbMATH DE number 2159026

zbMATH Keywords

simulated annealinggraph partitioningglobal minimairregular graphsNonlinear optimizationant-lion methodhypersurface deformation

Mathematics Subject Classification ID

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

Cites Work

• Optimization by Simulated Annealing
• Title not available (Why is that?)

Cited In (4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963544)