A new approach to choosing initial points in local search

DOI10.1016/0020-0190(89)90111-7zbMath0665.68050OpenAlexW2046636186MaRDI QIDQ1116345

Robert J. T. Morris, Wing Shing Wong

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90111-7

zbMATH Keywords

combinatorial optimizationLocal searchmultistart methodspartition by spheres

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorial optimization (90C27)

Related Items (2)

Systematic choice of initial points in local search: Extensions and application to neural networks ⋮ Mechanisms for local search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bayesian stopping rules for multistart global optimization methods
• On the Systematic Search in a Hypercube
• An Efficient Heuristic Procedure for Partitioning Graphs
• On Quasi-Metric Spaces
• 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: A new approach to choosing initial points in local search