Maximal dynamic polymatroid flows and applications
type: Item
instance of: scholarly article
title: Maximal dynamic polymatroid flows and applications
zbMATH Open document ID: 0594.90023
DOI: 10.1016/0166-218X(86)90017-X
published in: Discrete Applied Mathematics
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 3956776
zbMATH Keywords: dynamic polymatroid flows
zbMATH Keywords: time expanded network algorithm
zbMATH Keywords: dynamic matroid intersection
zbMATH Keywords: dynamic matroid partitionings
author: Horst W. Hamacher
MaRDI profile type: Publication
cites work: Optimum branchings
cites work: Q5514188
cites work: A time expanded matroid algorithm for finding optimal dynamic matroid intersections
cites work: A simple derivation of edmonds' algorithm for optimum branchings
cites work: Q3048571
cites work: Computing Maximal “Polymatroidal” Network Flows
cites work: Flow Network Formulations of Polymatroid Optimization Problems
cites work: Finding optimum branchings
description: scientific article; zbMATH DE number 3956776