Computational complexity of the problem of choosing exchange alternatives with a limited number of indivisible resources
type: Item
instance of: scholarly article
title: Computational complexity of the problem of choosing exchange alternatives with a limited number of indivisible resources
zbMATH Open document ID: 0531.90071
author: V. M. Temkin
published in: Automation and Remote Control
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 91B50
zbMATH DE Number: 3843501
zbMATH Keywords: NP-hardness
zbMATH Keywords: housing market management
zbMATH Keywords: computational complexity
zbMATH Keywords: combinatorial programming
zbMATH Keywords: optimal set of exchange alternatives
zbMATH Keywords: indivisible resources
zbMATH Keywords: vertex covering of a graph
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 3843501