Studying the complexity of global verification for NP-hard discrete optimization problems
type: Item
instance of: scholarly article
title: Studying the complexity of global verification for NP-hard discrete optimization problems
zbMATH Open document ID: 1035.90112
DOI: 10.1023/A:1024680908847
author: Derek E. Armstrong
author: Sheldon H. Jacobson
published in: Journal of Global Optimization
publication date: 2003-08-28T00:00:00Z
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1972171
zbMATH Keywords: computational complexity
zbMATH Keywords: discrete optimization problems
zbMATH Keywords: local search algorithms
zbMATH Keywords: NP-hard
MaRDI profile type: Publication
full work available at URL: a:1024680908847
OpenAlex ID: W1498470506
description: scientific article; zbMATH DE number 1972171