An asymptotically exact algorithm for one modification of planar three-index assignment
From MaRDI portal
Recommendations
- On Asymptotically Optimal Algorithm for One Modification of Planar 3-dimensional Assignment Problem
- Probabilistic analysis of an algorithm for the m-planar 3-index assignment problem on single-cycle permutations on one-cycle permutations
- Investigation of polynomial algorithms for solving the three-index planar assignment problem
- scientific article; zbMATH DE number 2097292
- An algorithm for the planar three-index assignment problem
Cited in
(11)- An algorithm for the planar three-index assignment problem
- Multi-index transport problems with decomposition structure
- A heuristic method for solving integer-valued decompositional multiindex problems
- An adaptive algorithm for solving the axial three-index assignment problem
- Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below
- Multiindex transportation problems with 2-embedded structure
- scientific article; zbMATH DE number 2097292 (Why is no real title available?)
- Probabilistic analysis of an algorithm for the m-planar 3-index assignment problem on single-cycle permutations on one-cycle permutations
- Investigation of polynomial algorithms for solving the three-index planar assignment problem
- On Asymptotically Optimal Algorithm for One Modification of Planar 3-dimensional Assignment Problem
- A hybrid genetic algorithm for the three-index assignment problem
This page was built for publication: An asymptotically exact algorithm for one modification of planar three-index assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115611)
