Lower bounds for the axial three-index assignment problem

DOI10.1016/j.ejor.2009.06.019zbMath1176.90357OpenAlexW2140501905MaRDI QIDQ1040985

Lu Sun, Bum-Jin Kim, William L. Hightower, Yi-Rong Zhu, Peter M. Hahn

Publication date: 27 November 2009

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.06.019

zbMATH Keywords

integer programminglower boundsaxial 3-index assignment

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (3)

On a property of a three-dimensional matrix ⋮ A reduction approach to the repeated assignment problem ⋮ Combining solutions of the axial assignment problem

Cites Work

• Approximation algorithms for three-dimensional assignment problems with triangle inequalities
• A hybrid genetic algorithm for the three-index assignment problem
• Throughput rate optimization in the automated assembly of printed circuit boards
• Complexity of a 3-dimensional assignment problem
• Three-dimensional axial assignment problems with decomposable cost coefficients
• The quadratic three-dimensional assignment problem: exact and approximate solution methods
• GRASP with Path Relinking for Three-Index Assignment
• Algorithms for the Assignment and Transportation Problems
• An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
• An Algorithm for the Three-Index Assignment Problem
• Letter to the Editor—The Multidimensional Assignment Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lower bounds for the axial three-index assignment problem