Investigation of polynomial algorithms for solving the three-index planar assignment problem
From MaRDI portal
Recommendations
- Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem
- Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem
- An Algorithm for the Three-Index Assignment Problem
- scientific article; zbMATH DE number 1894378
- An asymptotically exact algorithm for one modification of planar three-index assignment
Cited in
(15)- An algorithm for the planar three-index assignment problem
- Asymptotic approach to the solution of a multicriterion three-index planar problem of choice
- Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem.
- Tabu search for the planar three-index assignment problem
- Decomposition method for solving a three-index planar assignment problem
- Combining solutions of the axial assignment problem
- A heuristic method for solving integer-valued decompositional multiindex problems
- Decomposition method for solving the three-index problem of effective shooting
- An asymptotically exact algorithm for one modification of planar three-index assignment
- An Algorithm for the Three-Index Assignment Problem
- scientific article; zbMATH DE number 2097292 (Why is no real title available?)
- On Asymptotically Optimal Algorithm for One Modification of Planar 3-dimensional Assignment Problem
- Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem
- Criteria convolutions when combining the solutions of the multicriteria axial assignment problem
- Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem
This page was built for publication: Investigation of polynomial algorithms for solving the three-index planar assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310934)