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

DOI10.1007/s10559-006-0031-5zbMath1101.90063OpenAlexW1975894680MaRDI QIDQ852261

V. M. Kravtsov

Publication date: 28 November 2006

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-006-0031-5

zbMATH Keywords

approximate algorithmasymptotically optimal solution

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (3)

On optimality of a polynomial algorithm for random linear multidimensional assignment problem ⋮ On random multi-dimensional assignment problems ⋮ Efficient algorithms for three‐dimensional axial and planar random assignment problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A three-dimensional matching model for perishable production scheduling
• Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
• Asymptotic approach to solving the multi-index axial transportation problem
• Asymptotic approach to the problem of \(k\)-median of a graph
• Asymptotic optimality of a transport-problem plan constructed by the minimum-element method
• Facets of the three-index assignment polytope
• On the average number of steps of the simplex method of linear programming
• Finding the set of alternatives in discrete multicriterion problems
• Metric aspects of integer linear programming
• Letter to the Editor—The Multidimensional Assignment Problem
• A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem

This page was built for publication: Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem