Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method
From MaRDI portal
Publication:1407352
DOI10.1023/A:1015504501828zbMath1033.90103MaRDI QIDQ1407352
Publication date: 16 September 2003
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Related Items
Analysis of mathematical models and methods of solving combinatorial optimization problems on game-type permutations, Games with combinatorial constraints, Analysis of an algorithm for solution of conditional optimization problems with linear-fractional objective functions over permutations, A nonreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on arrangements