Between a rock and a hard place: the two-to-one assignment problem
type: Item
instance of: scholarly article
title: Between a rock and a hard place: the two-to-one assignment problem
zbMATH Open document ID: 1261.90023
author: Dries R. Goossens
author: S. Polyakovskiy
author: Frits C. R. Spieksma
author: Gerhard J. Woeginger
published in: Mathematical Methods of Operations Research
publication date: 2013-02-20T00:00:00Z
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6137612
zbMATH Keywords: assignment problem
zbMATH Keywords: matching problem
zbMATH Keywords: efficient algorithm
zbMATH Keywords: approximation
MaRDI profile type: Publication
full work available at URL: s00186-012-0397-2
OpenAlex ID: W2014998043
cites work: Approximation algorithms for multi-dimensional assignment problems with decomposable costs
cites work: Three-dimensional axial assignment problems with decomposable cost coefficients
cites work: Approximation algorithms for three-dimensional assignment problems with triangle inequalities
cites work: Analysis of a Compound Bin Packing Algorithm
cites work: The approximability of three-dimensional assignment problems with bottleneck objective
cites work: Q4198056
cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete
cites work: The hardness of approximation: Gap location
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Geometric three-dimensional assignment problems
cites work: Scheduling sports competitions on multiple venues.
DOI: 10.1007/S00186-012-0397-2
description: scientific article; zbMATH DE number 6137612