Pages that link to "Item:Q1082266"
From MaRDI portal
The following pages link to Optimization of dynamic programming methods when solving extremal combinatorial problems (Q1082266):
Displaying 7 items.
- A combinatorial structure ensuring applicability of the dynamic programming method (Q918440) (← links)
- A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems (Q980008) (← links)
- Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method (Q1407352) (← links)
- A method of determining a sequence of the best solutions to the problems of optimization on finite sets and the problem of network reconstruction (Q1778684) (← links)
- Extensions of dynamic programming for multi-stage combinatorial optimization (Q2205944) (← links)
- An Incremental Model for Combinatorial Maximization Problems (Q5307529) (← links)
- A Dynamic Programming Solution to Bounded Dejittering Problems (Q5864004) (← links)