Systematic choice of initial points in local search: Extensions and application to neural networks
From MaRDI portal
Publication:1182102
DOI10.1016/0020-0190(91)90182-HzbMath0735.68022OpenAlexW2081378606MaRDI QIDQ1182102
Robert J. T. Morris, Wing Shing Wong
Publication date: 27 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(91)90182-h
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Combinatorics in computer science (68R05) Neural networks for/in biological studies, artificial life and related topics (92B20)
Cites Work
- Unnamed Item
- Unnamed Item
- A new approach to choosing initial points in local search
- Random optimization
- An approach to nonlinear programming
- Bayesian stopping rules for multistart global optimization methods
- On the Systematic Search in a Hypercube
- Heuristic-Programming Solution of a Flowshop-Scheduling Problem
- Analytic Inequalities
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: Systematic choice of initial points in local search: Extensions and application to neural networks