Decomposition method for solving a three-index planar assignment problem

DOI10.1134/S1064230720050056zbMATH Open1502.90106OpenAlexW3092038080MaRDI QIDQ1995353FDOQ1995353

Authors: L. G. Dumbadze, V. Yu. Leonov, A. P. Tizik, V. 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

Recommendations

• An algorithm for the planar three-index assignment problem
• Investigation of polynomial algorithms for solving the three-index planar assignment problem
• Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem
• Method of sequential modification of the objective function in the assignment problem
• An Algorithm for the Three-Index Assignment Problem

Mathematics Subject Classification ID

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

Cites Work

• Assignment Problems
• 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
• Method of sequential modification of the objective function in the assignment problem
• Title not available (Why is that?)

Cited In (4)

• Spectral decompositions and feasible directions in the axial three-index assignment problem
• Title not available (Why is that?)
• Combining solutions of the axial assignment problem
• Decomposition method for solving the three-index problem of effective shooting

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1995353)