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

zbMATH Open1161.90439MaRDI QIDQ1852514FDOQ1852514

A. P. Krachkovskij, M. K. Kravtsov

Publication date: 26 June 2003

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

zbMATH Keywords

minimizationobjective functionoptimal solutionorderpolynomial algorithmoperationsMulti-index choice problem

Mathematics Subject Classification ID

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

Cited In (1)

• Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On optimality of a polynomial algorithm for random linear multidimensional assignment problem 👍 👎
• Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem 👍 👎
• Polynomial algorithms for p-dispersion problems in a planar Pareto Front 👍 👎
• 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 👍 👎

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)