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

zbMath1161.90439MaRDI QIDQ1852514

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

orderminimizationpolynomial algorithmobjective functionoptimal solutionoperationsMulti-index choice problem

Mathematics Subject Classification ID

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

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