Postoptimal Analysis in Nonserial Dynamic Programming

DOI10.1007/978-3-540-87477-5_34MaRDI QIDQ3627708zbMATH OpenOpenAlexFDO

Authors Oleg A. Shcherbina

Publication date 13 May 2009

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87477-5_34

Mathematics Subject Classification ID

Dynamic programming (90C39)

Recommendations

• Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization
• On the complexity of postoptimality analysis of 0/1 programs
• scientific article; zbMATH DE number 3959083
• A Comprehensive Model of Dynamic Programming
• scientific article; zbMATH DE number 1163812

Cites work

• scientific article; zbMATH DE number 3564693 (Why is no real title available?)
• An Approximate Minimum Degree Ordering Algorithm
• Complexity of Finding Embeddings in a k-Tree
• Cost-Bounded Binary Decision Diagrams for 0-1 Programming
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization
• Sensitivity Analysis for Branch and Bound Integer Programming
• The Use of Linear Graphs in Gauss Elimination

Cited in

(2)

• On the complexity of postoptimality analysis of 0/1 programs
• scientific article; zbMATH DE number 4033460 (Why is no real title available?)

Describes a project that uses

Uses Software

• METIS

This page was built for publication: Postoptimal Analysis in Nonserial Dynamic Programming

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