A time expanded matroid algorithm for finding optimal dynamic matroid intersections

DOI10.1007/BF01920309zbMath0577.05022OpenAlexW1981119931MaRDI QIDQ3698812

Horst W. Hamacher

Publication date: 1985

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01920309

zbMATH Keywords

dynamicfeasible solutionflows in networksmaximum weight matroid intersection

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Combinatorial aspects of matroids and geometric lattices (05B35) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Maximal dynamic polymatroid flows and applications ⋮ On the expected value of stochastic linear programs and (dynamic) network flow problems ⋮ Connectedness of efficient solutions in multiple criteria combinatorial optimization

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: A time expanded matroid algorithm for finding optimal dynamic matroid intersections