Pages that link to "Item:Q1407352"
From MaRDI portal
The following pages link to Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method (Q1407352):
Displaying 9 items.
- A combinatorial structure ensuring applicability of the dynamic programming method (Q918440) (← links)
- Analysis of mathematical models and methods of solving combinatorial optimization problems on game-type permutations (Q941198) (← links)
- A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems (Q980008) (← links)
- Games with combinatorial constraints (Q1008310) (← links)
- Optimization of dynamic programming methods when solving extremal combinatorial problems (Q1082266) (← links)
- Dynamic programming in the problem of optimization of a covering (Q1914130) (← links)
- Analysis of an algorithm for solution of conditional optimization problems with linear-fractional objective functions over permutations (Q2480505) (← links)
- A nonreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on arrangements (Q2577240) (← links)
- (Q4675016) (← links)