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

DOI10.1007/S10559-006-0031-5MaRDI QIDQ852261zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem
• Investigation of polynomial algorithms for solving the three-index planar assignment problem
• Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem.
• A polynomial algorithm for the multi-index decision problem
• Asymptotic approach to solving the multi-index axial transportation problem

Cites work

• scientific article; zbMATH DE number 3917336 (Why is no real title available?)
• scientific article; zbMATH DE number 3965059 (Why is no real title available?)
• scientific article; zbMATH DE number 3494159 (Why is no real title available?)
• scientific article; zbMATH DE number 2097292 (Why is no real title available?)
• scientific article; zbMATH DE number 808804 (Why is no real title available?)
• scientific article; zbMATH DE number 808811 (Why is no real title available?)
• A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem
• A three-dimensional matching model for perishable production scheduling
• 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
• Finding the set of alternatives in discrete multicriterion problems
• Letter to the Editor—The Multidimensional Assignment Problem
• Metric aspects of integer linear programming
• Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
• On the average number of steps of the simplex method of linear programming

Cited in

(11)

• Investigation of polynomial algorithms for solving the three-index planar assignment problem
• Resolvability of multi-index axial assignment problem on one-cyclic substitutions
• Remark on the paper ``A polynomial algorithm for the multi-index choice problem
• On optimality of a polynomial algorithm for random linear multidimensional assignment problem
• Asymptotic approach to solving the multi-index axial transportation problem
• Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem.
• Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
• Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem
• On random multi-dimensional assignment problems
• A polynomial algorithm for the multi-index decision problem
• Efficient algorithms for three‐dimensional axial and planar random assignment problems

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

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