Postoptimal Analysis in Nonserial Dynamic Programming

DOI10.1007/978-3-540-87477-5_34zbMath1160.90685OpenAlexW2139007759MaRDI QIDQ3627708

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)

Uses Software

• METIS

Cites Work

• Unnamed Item
• The Use of Linear Graphs in Gauss Elimination
• Cost-Bounded Binary Decision Diagrams for 0-1 Programming
• Sensitivity Analysis for Branch and Bound Integer Programming
• Complexity of Finding Embeddings in a k-Tree
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• An Approximate Minimum Degree Ordering Algorithm
• Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization

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