New lower bounds for the triplanar assignment problem. Use of the classical model

Authors:
S. I. Sergeev
Affiliations:
Moscow State University of Economics, Statistics, and Informatics, Moscow, Russia
Venue:
Automation and Remote Control
Year:
2008

Citing 2
Cited 2

An algorithm for the three-index assignment problem

Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Multi-index transport problems with decomposition structure

Automation and Remote Control
Multiindex transportation problems with 2-embedded structure

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

New sharp lower bounds are suggested for a triplanar assignment problem. They are based on the use of results of the theory of optimal control, the classical formulation of the problem, and represent, in our opinion, the "limit" use of the Hungarian algorithm ideas implemented for the two-index assignment problem.