Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem.

MaRDI QIDQ1852514zbMATH OpenFDO

Authors M. K. Kravtsov, A. P. Krachkovskij

Publication date 26 June 2003

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

minimizationMulti-index choice problemobjective functionoperationsoptimal solutionorderpolynomial algorithm

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Discrete approximations in optimal control (49M25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Integer programming (90C10) Combinatorial optimization (90C27)

Review text

This paper is devoted to an algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem. The authors propose and substantiate a new algorithm for solving the 3-planar choice problem of order \(n\) in \(O(n^4)\) operations under some additional conditions for the coefficients of the objective function.

Recommendations

• Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem
• A polynomial algorithm for the multi-index decision problem
• Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem
• Remark on the paper ``A polynomial algorithm for the multi-index choice problem
• scientific article; zbMATH DE number 5823944
• Investigation of polynomial algorithms for solving the three-index planar assignment problem
• On optimality of a polynomial algorithm for random linear multidimensional assignment problem
• Polynomial algorithms for p-dispersion problems in a planar Pareto Front
• scientific article; zbMATH DE number 3995454
• Asymptotic approach to the solution of a multicriterion three-index planar problem of choice

Cited in

(7)

• Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
• Remark on the paper ``A polynomial algorithm for the multi-index choice problem
• Asymptotic approach to the solution of a multicriterion three-index planar problem of choice
• Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem
• A polynomial algorithm for the multi-index decision problem
• Optimizing hedonic editing for multiple outcomes: an algorithm
• Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem

This page was built for publication: Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem.

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