Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem

Authors:
V. M. Kravtsov
Affiliations:
Administration of General Industrial Safety and Foreign Economic Activity of the Department for the Supervision of Safety of Works in Industry and Nuclear-Power Engineering, Ministry for Emergency ...
Venue:
Cybernetics and Systems Analysis
Year:
2005

Citing 6
Cited 1

Polytopes, graphs and optimisation

Polytopes, graphs and optimisation
Facets of the three-index assignment polytope

Discrete Applied Mathematics
Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking

Computational Optimization and Applications
A three-dimensional matching model for perishable production scheduling

Discrete Applied Mathematics
A Set of Greedy Randomized Adaptive Local Search Procedure (GRASP) Implementations for the Multidimensional Assignment Problem

Computational Optimization and Applications
Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem

Cybernetics and Systems Analysis

Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

To construct the asymptotically optimum plan of the p-index axial assignment problem of order n, p algorithms 驴0, 驴1, ..., 驴 p驴1 with complexities equal to O(np+1), O(np), ..., O(n2) operations, respectively, are proposed and substantiated under some additional conditions imposed on the coefficients of the objective function.