Multiple optima in local search

DOI10.1016/0196-6774(87)90041-1MaRDI QIDQ3754442zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

local search methodsmaximum independent set problem

Mathematics Subject Classification ID

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

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

Cited in

(8)

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

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)