Approximation algorithms for three-dimensional assignment problems with triangle inequalities

DOI10.1016/0377-2217(92)90078-nzbMath0761.90071MaRDI QIDQ139206

Yves Crama, Frits C.R. Spieksma, Frits C. R. Spieksma, Yves Cramer

Publication date: August 1992

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristics; computational analysis; three-dimensional assignment

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C10: Integer programming

90C60: Abstract computational complexity for mathematical programming problems

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

approxmatch, A hybrid genetic algorithm for the three-index assignment problem, A survey for the quadratic assignment problem, Geometric three-dimensional assignment problems, Approximation algorithms for multi-dimensional assignment problems with decomposable costs, Approximation algorithms for multi-index transportation problems with decomposable costs, Test problem generator for the multidimensional assignment problem, Scheduling sports competitions on multiple venues., Three-dimensional axial assignment problems with decomposable cost coefficients, Scheduling jobs of equal length: Complexity, facets and computational results

Cites Work

• Throughput rate optimization in the automated assembly of printed circuit boards
• Facets of the three-index assignment polytope
• An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
• A bilinear programming formulation of the 3-dimensional assignment problem
• Unnamed Item
• Unnamed Item
• Unnamed Item