Efficient application of nonserial dynamic programming in combinatorial optimization

MaRDI QIDQ1111950zbMATH OpenFDO

Authors S. B. Fleishman

Publication date 1988

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

sufficient conditionspolynomial algorithmspolynomial convergencenon-serial dynamic programming

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Dynamic programming (90C39)

Cited in

(5)

• scientific article; zbMATH DE number 4033460 (Why is no real title available?)
• Extension of dynamic programming to nonseparable dynamic optimization problems
• A combinatorial structure ensuring applicability of the dynamic programming method
• Optimization of dynamic programming methods when solving extremal combinatorial problems
• Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization

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)