Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method
From MaRDI portal
(Redirected from Publication:1407352)
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)- scientific article; zbMATH DE number 1884454 (Why is no real title available?)
- 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
- 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
- scientific article; zbMATH DE number 2168903 (Why is no real title available?)
- scientific article; zbMATH DE number 165534 (Why is no real title available?)
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1407352)