Optimal search with positive switch cost is NP-hard
type: Item
instance of: scholarly article
title: Optimal search with positive switch cost is NP-hard
zbMATH Open document ID: 0577.90041
DOI: 10.1016/0020-0190(85)90108-5
author: Ingo Wegener
published in: Information Processing Letters
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B40
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3924496
zbMATH Keywords: NP-hardness
zbMATH Keywords: optimal search
zbMATH Keywords: positive switch cost
zbMATH Keywords: optimal strategy
MaRDI profile type: Publication
full work available at URL: 0020-0190(85)90108-5
OpenAlex ID: W2084476663
cites work: Discrete Dynamic Programming
cites work: Q4155835
cites work: Optimal Search Strategies
cites work: Q4058812
cites work: Discrete Sequential Search with Positive Switch Cost
cites work: Optimal Search for Detecting a Hidden Object
cites work: The Euclidean traveling salesman problem is NP-complete
description: scientific article; zbMATH DE number 3924496