Dynamic programming and graph optimization problems

DOI10.1016/0898-1221(94)90123-6zbMath0800.90748OpenAlexW2023066824MaRDI QIDQ1327180

V. Pereyra

Publication date: 15 June 1994

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(94)90123-6

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedoids
• Optimum ordered bi-weighted binary trees
• A class of nonseparable dynamic programming problems
• Richard Bellman's contributions to computer science
• Ancestor tree for arbitrary multi-terminal cut functions
• Maximum concurrent flows and minimum cuts
• The art and theory of dynamic programming
• Optimum binary search trees
• Maximal Flow Through a Network
• Computation of Matrix Chain Products. Part II
• Very Simple Methods for All Pairs Network Flow Analysis
• Triangulations (tilings) and certain block triangular matrices
• Binary Search on a Tape
• Solution Bases of Multiterminal Cut Problems
• Multi-Terminal Network Flows
• An O(n) algorithm to find a near-optimum partition of a convex polygon
• Computation of Matrix Chain Products. Part I
• Speed-Up in Dynamic Programming
• An O(n) algorithm for determining a near-optimal computation order of matrix chain products
• Use of Floyd'S Algorithm to Find Shortest Restricted Paths
• Binary Trees Optimum Under Various Criteria
• A Method for the Construction of Minimum-Redundancy Codes
• Scheduling to Minimize Interaction Cost
• Contraction Mappings in the Theory Underlying Dynamic Programming
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• A Theorem on Boolean Matrices

This page was built for publication: Dynamic programming and graph optimization problems