Multiple optima in local search

DOI10.1016/0196-6774(87)90041-1zbMATH Open0617.90072OpenAlexW2044008115MaRDI QIDQ3754442FDOQ3754442

Authors:

Publication date: 1987

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(87)90041-1

Recommendations

• How easy is local search?
• Local search: complexity and approximation
• scientific article; zbMATH DE number 18531
• Hill Climbing with Multiple Local Optima
• Fast local search for the maximum independent set problem

zbMATH Keywords

maximum independent set problemlocal search methods

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10)

Cited In (8)

• Pseudo-Boolean optimization
• A multi-local optimization algorithm
• Analyzing the complexity of finding good neighborhood functions for local search algorithms
• An analysis of neighborhood functions on generic solution spaces
• Data-independent neighborhood functions and strict local optima
• Polynomial transformations and data-independent neighborhood functions
• Local optimization on graphs
• On characterization of maximal independent sets via quadratic optimization

This page was built for publication: Multiple optima in local search

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