Between a rock and a hard place: the two-to-one assignment problem

DOI10.1007/s00186-012-0397-2zbMath1261.90023OpenAlexW2014998043MaRDI QIDQ1935948

Frits C. R. Spieksma, Dries R. Goossens, Sergey Polyakovskiy, Gerhard J. Woeginger

Publication date: 20 February 2013

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-012-0397-2

zbMATH Keywords

approximationmatching problemassignment problemefficient algorithm

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items

The transportation problem with conflicts ⋮ Branch-and-price approaches for the multiperiod technician routing and scheduling problem ⋮ Multi-dimensional vector assignment problems

Cites Work

• Unnamed Item
• Approximation algorithms for three-dimensional assignment problems with triangle inequalities
• The approximability of three-dimensional assignment problems with bottleneck objective
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• Geometric three-dimensional assignment problems
• Approximation algorithms for multi-dimensional assignment problems with decomposable costs
• The hardness of approximation: Gap location
• Scheduling sports competitions on multiple venues.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Three-dimensional axial assignment problems with decomposable cost coefficients
• Analysis of a Compound Bin Packing Algorithm

This page was built for publication: Between a rock and a hard place: the two-to-one assignment problem