Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method

DOI10.1023/A:1015504501828zbMath1033.90103OpenAlexW1506278838MaRDI QIDQ1407352

E. V. Roskladka, O. A. Emets

Publication date: 16 September 2003

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

Full work available at URL: https://doi.org/10.1023/a:1015504501828

zbMATH Keywords

dynamic programming methodcombinatorial optimization problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (4)

Analysis of mathematical models and methods of solving combinatorial optimization problems on game-type permutations ⋮ Analysis of an algorithm for solution of conditional optimization problems with linear-fractional objective functions over permutations ⋮ Games with combinatorial constraints ⋮ A nonreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on arrangements

This page was built for publication: Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method