Decomposition method for solving a three-index planar assignment problem

DOI10.1134/S1064230720050056zbMath1502.90106OpenAlexW3092038080MaRDI QIDQ1995353

A. P. Tizik, V. Yu. Leonov, L. G. Dumbadze, Vladimir I. Tsurkov

Publication date: 23 February 2021

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064230720050056

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items (1)

Combining solutions of the axial assignment problem

Cites Work

• Unnamed Item
• Method of sequential modification of the objective function in the assignment problem
• Arrays of distinct representatives --- a very simple NP-complete problem
• Complexity of a 3-dimensional assignment problem
• Iterative functional modification method for solving a transportation problem
• Assignment Problems

This page was built for publication: Decomposition method for solving a three-index planar assignment problem