Analyzing the complexity of finding good neighborhood functions for local search algorithms
type: Item
instance of: scholarly article
title: Analyzing the complexity of finding good neighborhood functions for local search algorithms
zbMATH Open document ID: 1114.90164
author: Derek E. Armstrong
author: Sheldon H. Jacobson
published in: Journal of Global Optimization
publication date: 2007-01-05T00:00:00Z
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 5081906
zbMATH Keywords: Computational complexity
zbMATH Keywords: Local search algorithms
zbMATH Keywords: NP-hard discrete optimization problems
MaRDI profile type: Publication
full work available at URL: s10898-006-9007-2
OpenAlex ID: W2068598433
cites work: Q4339078
cites work: Polynomial transformations and data-independent neighborhood functions
cites work: Studying the complexity of global verification for NP-hard discrete optimization problems
cites work: Structure preserving reductions among convex optimization problems
cites work: Approximate solution of NP optimization problems
cites work: Q4258216
cites work: Local search, reducibility and approximability of NP-optimization problems
cites work: The complexity of theorem-proving procedures
cites work: On approximation scheme preserving reducibility and its applications
cites work: Q4198056
cites work: The effectiveness of finite improvement algorithms for finding global optima
cites work: How easy is local search?
cites work: Optimization, approximation, and complexity classes
cites work: Complexity of uniqueness and local search in quadratic 0-1 programming
cites work: On complexity of unconstrained hyperbolic 0--1 programming problems
cites work: Multiple optima in local search
cites work: Q4252434
DOI: 10.1007/S10898-006-9007-2
Recommended article: A Complexity Analysis of Local Search Algorithms in Global Optimization
Recommended article: Q3059322
Recommended article: A note on the complexity of local search problems
Recommended article: Q4228483
Recommended article: An experimental analysis of local minima to improve neighbourhood search.
Recommended article: A Survey of Approximation Results for Local Search Algorithms
Recommended article: Intensification neighborhoods for local search methods
Recommended article: A framework for analyzing sub-optimal performance of local search algorithms
Recommended article: Q3115272
Recommended article: Q3975934
description: scientific article; zbMATH DE number 5081906