Efficient application of nonserial dynamic programming in combinatorial optimization
From MaRDI portal
Publication:1111950
zbMATH Open0658.90096MaRDI QIDQ1111950
Publication date: 1988
Published in: Automation and Remote Control (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items (4)
Optimization of dynamic programming methods when solving extremal combinatorial problems ⋮ A combinatorial structure ensuring applicability of the dynamic programming method ⋮ Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization ⋮ Extension of dynamic programming to nonseparable dynamic optimization problems
This page was built for publication: Efficient application of nonserial dynamic programming in combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111950)
