Complexity of a 3-dimensional assignment problem
type: Item
instance of: scholarly article
title: Complexity of a 3-dimensional assignment problem
zbMATH Open document ID: 0507.90057
DOI: 10.1016/0377-2217(83)90078-4
published in: European Journal of Operational Research
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 3801297
zbMATH Keywords: 3-dimensional assignment problem
zbMATH Keywords: bipartite graphs
zbMATH Keywords: perfect matchings
zbMATH Keywords: computational complexity
zbMATH Keywords: NP-completeness
Wikidata QID: Q57401637
author: Alan Frieze
MaRDI profile type: Publication
full work available at URL: 0377-2217(83)90078-4
OpenAlex ID: W1965178295
cites work: Q3880581
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
cites work: Q4198056
cites work: Q4142699
cites work: Q5643803
description: scientific article; zbMATH DE number 3801297