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

non-serial dynamic programmingpolynomial algorithmspolynomial convergencesufficient conditions

Mathematics Subject Classification ID

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

Review text

This paper presents sufficient conditions for polynomial convergence of non-serial dynamic programming. A corollary yields polynomial algorithms for solving some well-known optimization problems on new classes of graphs.

Cited in

(5)

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

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)