Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method
From MaRDI portal
Publication:1407352
DOI10.1023/A:1015504501828zbMATH Open1033.90103OpenAlexW1506278838MaRDI QIDQ1407352FDOQ1407352
Authors: O. A. Yemets', E. V. Roskladka 
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
Recommendations
- Theory and methods of Euclidian combinatorial optimization: current status and prospects
- The dynamic programming method in the generalized traveling salesman problem
- Optimization of dynamic programming methods when solving extremal combinatorial problems
- scientific article; zbMATH DE number 165534
- Solving the routing optimization problem using the dynamic programming method
Cited In (10)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A nonreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on arrangements
- Title not available (Why is that?)
- 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 combinatorial structure ensuring applicability of the dynamic programming method
- Optimization of dynamic programming methods when solving extremal combinatorial problems
- A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems
This page was built for publication: Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1407352)
