Approximation algorithms for three-dimensional assignment problems with triangle inequalities

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

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

Publication date: August 1992

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

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90078-n

zbMATH Keywords

heuristicscomputational analysisthree-dimensional assignment

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (34)

A hybrid genetic algorithm for the three-index assignment problem ⋮ Approximation algorithms for multi-dimensional assignment problems with decomposable costs ⋮ Branch and bound solution of the multidimensional assignment problem formulation of data association ⋮ The approximability of three-dimensional assignment problems with bottleneck objective ⋮ A survey for the quadratic assignment problem ⋮ Approximation algorithms for multi-index transportation problems with decomposable costs ⋮ Fast separation for the three-index assignment problem ⋮ The three-dimensional matching problem in kalmanson matrices ⋮ Three-dimensional axial assignment problems with decomposable cost coefficients ⋮ Scheduling jobs of equal length: Complexity, facets and computational results ⋮ Multiindex transportation problems with 2-embedded structure ⋮ A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem ⋮ Between a rock and a hard place: the two-to-one assignment problem ⋮ On optimality of a polynomial algorithm for random linear multidimensional assignment problem ⋮ Three-index linear programs with nested structure ⋮ Dynamic discrete tomography ⋮ Geometric versions of the three-dimensional assignment problem under general norms ⋮ On a property of a three-dimensional matrix ⋮ Integer programming models for the multidimensional assignment problem with star costs ⋮ Local search heuristics for the multidimensional assignment problem ⋮ Multi-index transport problems with decomposition structure ⋮ A heuristic method for solving integer-valued decompositional multiindex problems ⋮ Test problem generator for the multidimensional assignment problem ⋮ approxmatch ⋮ Using Approximation Algorithms to Build Evidence Factors and Related Designs for Observational Studies ⋮ Combining solutions of the axial assignment problem ⋮ Scheduling sports competitions on multiple venues. ⋮ An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors ⋮ Geometric three-dimensional assignment problems ⋮ Heuristic strategies for combining solutions of the three-index axial assignment problem ⋮ Local Search Heuristics for the Multidimensional Assignment Problem ⋮ Lower bounds for the axial three-index assignment problem ⋮ Multi-dimensional vector assignment problems ⋮ The focus of attention problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Approximation algorithms for three-dimensional assignment problems with triangle inequalities