Lower bounds for the axial three-index assignment problem
From MaRDI portal
Publication:1040985
DOI10.1016/J.EJOR.2009.06.019zbMATH Open1176.90357OpenAlexW2140501905MaRDI QIDQ1040985FDOQ1040985
Authors: Bum-Jin Kim, William L. Hightower, Peter M. Hahn, Yi-Rong Zhu, Lu Sun 
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
Recommendations
- Spectral decompositions and feasible directions in the axial three-index assignment problem
- An adaptive algorithm for solving the axial three-index assignment problem
- The three-dimensional assignment and partition problems. New lower bounds
- On non-integer vertices of the polytope of the three-index axial assignment problem
- On the maximum noninteger polyhedron vertices of the three-index axial assignment problem
- Three-dimensional axial assignment problems with decomposable cost coefficients
- Axial three-index assignment and traveling salesman problems: fast approximate algorithms and their probabilistic analysis
- Linear-time separation algorithms for the three-index assignment polytope
- scientific article; zbMATH DE number 2097292
- An Algorithm for the Three-Index Assignment Problem
Cites Work
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
- Title not available (Why is that?)
- Title not available (Why is that?)
- Letter to the Editor—The Multidimensional Assignment Problem
- Throughput rate optimization in the automated assembly of printed circuit boards
- Three-dimensional axial assignment problems with decomposable cost coefficients
- GRASP with path relinking for three-index assignment
- Title not available (Why is that?)
- Algorithms for the Assignment and Transportation Problems
- Complexity of a 3-dimensional assignment problem
- An Algorithm for the Three-Index Assignment Problem
- A hybrid genetic algorithm for the three-index assignment problem
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- Title not available (Why is that?)
- A reduction approach to the repeated assignment problem
- Spectral decompositions and feasible directions in the axial three-index assignment problem
- New lower bounds for the triplanar assignment problem. Use of the classical model
- On a property of a three-dimensional matrix
- Title not available (Why is that?)
- The three-dimensional assignment and partition problems. New lower bounds
- Combining solutions of the axial assignment problem
- Criteria convolutions when combining the solutions of the multicriteria axial assignment problem
This page was built for publication: Lower bounds for the axial three-index assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040985)
