Optimization of dynamic programming methods when solving extremal combinatorial problems
From MaRDI portal
An approach is described whereby the realization of a dynamic programming method for solving an extremal combinatorial problem can be optimized. The aim of optimization is minimization of either the upper bound of the solution search time or the required working memory volume. The efficiency of the approach is illustrated by examples.
Recommendations
- Publication:3028751
- Extensions of dynamic programming for multi-stage combinatorial optimization
- Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method
- scientific article; zbMATH DE number 780787
- Efficient application of nonserial dynamic programming in combinatorial optimization
- Dynamic programming multi-objective combinatorial optimization
- Exact Algorithms for Generalized Combinatorial Optimization Problems
- Computational combinatorial optimization. Optimal of probably near-optimal solutions
- Dynamic programming bi-criteria combinatorial optimization
- Solution of combinatorial optimization problems with minimax criterion
Cited in
(12)- Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method
- A method of determining a sequence of the best solutions to the problems of optimization on finite sets and the problem of network reconstruction
- Extensions of dynamic programming for multi-stage combinatorial optimization
- Graphical approach to combinatorial optimization
- scientific article; zbMATH DE number 4016629 (Why is no real title available?)
- scientific article; zbMATH DE number 49116 (Why is no real title available?)
- scientific article; zbMATH DE number 165534 (Why is no real title available?)
- Combinatorial optimization solution of the optimal extremum problem of function
- An Incremental Model for Combinatorial Maximization Problems
- A Dynamic Programming Solution to Bounded Dejittering Problems
- A combinatorial structure ensuring applicability of the dynamic programming method
- A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems
This page was built for publication: Optimization of dynamic programming methods when solving extremal combinatorial problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082266)
