Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization

DOI10.1007/978-3-540-69995-8_26MaRDI QIDQ5391754zbMATH OpenOpenAlexFDO

Authors Oleg A. Shcherbina

Publication date 7 April 2011

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69995-8_26

Mathematics Subject Classification ID

Integer programming (90C10) Dynamic programming (90C39)

Recommendations

• Tree decomposition and discrete optimization problems: a survey
• scientific article; zbMATH DE number 4059125
• scientific article; zbMATH DE number 4123532
• Efficient application of nonserial dynamic programming in combinatorial optimization
• Practical access to dynamic programming on tree decompositions
• Practical access to dynamic programming on tree decompositions
• A class of nonseparable dynamic programming problems
• Optimal dynamic program for r-domination problems over tree decompositions
• The Fine Details of Fast Dynamic Programming over Tree Decompositions
• Extension of dynamic programming to nonseparable dynamic optimization problems

Cited in

(7)

• Tree decomposition and discrete optimization problems: a survey
• The Fine Details of Fast Dynamic Programming over Tree Decompositions
• Postoptimal Analysis in Nonserial Dynamic Programming
• scientific article; zbMATH DE number 4033460 (Why is no real title available?)
• scientific article; zbMATH DE number 4059125 (Why is no real title available?)
• Decomposition of arithmetical np-hard problems
• On nonserial modification of a local algorithm for the decomposition of discrete optimization problems

This page was built for publication: Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5391754)