Complexity of a class of nonlinear combinatorial problems related to their linear counterparts
type: Item
instance of: scholarly article
title: Complexity of a class of nonlinear combinatorial problems related to their linear counterparts
zbMATH Open document ID: 0805.90081
DOI: 10.1016/0377-2217(94)90254-2
author: Suresh P. Sethi
author: Wieslaw Kubiak
published in: European Journal of Operational Research
publication date: 1994-07-26T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 611370
zbMATH Keywords: linear combinatorial problems
zbMATH Keywords: NP-hard
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)90254-2
OpenAlex ID: W2017053537
cites work: Q4138187
cites work: Q4142699
cites work: Completion time variance minimization on a single machine is difficult
cites work: Q4739657
description: scientific article; zbMATH DE number 611370