A time expanded matroid algorithm for finding optimal dynamic matroid intersections

DOI10.1007/BF01920309MaRDI QIDQ3698812zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Two algorithms for weighted matroid intersection
• Efficient theoretic and practical algorithms for linear matroid intersection problems
• scientific article; zbMATH DE number 1555984
• scientific article; zbMATH DE number 4068895
• Maximal dynamic polymatroid flows and applications

Cited in

(5)

• Maximal dynamic polymatroid flows and applications
• On-line updating of solutions to a class of matroid intersection problems
• Connectedness of efficient solutions in multiple criteria combinatorial optimization
• Inverse problems of matroid intersection
• On the expected value of stochastic linear programs and (dynamic) network flow problems

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

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