Minimal cost flows in regular matroids

From MaRDI portal

Revision as of 20:09, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3896865

Jump to:navigation, search

DOI10.1007/BFB0120919zbMath0449.90095MaRDI QIDQ3896865

Horst W. Hamacher, Rainer E. Burkard

Publication date: 1981

Published in: Mathematical Programming Studies (Search for Journal in Brave)

zbMATH Keywords

algorithms regular matroids transformation method linear assignment problems Hungarian method admissible transformations minimal cost flows determination of maximal matroid flow negative circuits optimal matroid flow shortest augmenting circuits

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (12)

Max-balanced flows in oriented matroids ⋮ A note on \(K\) best network flows ⋮ On the use of lexicographic min cost flows in evacuation modeling ⋮ Miu Cost Tensions ⋮ Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning ⋮ Decomposition of group flows in regular matroids ⋮ On the generality of the greedy algorithm for solving matroid base problems ⋮ Greedy oriented flows ⋮ Characterizations of max-balanced flows ⋮ Capacity inverse minimum cost flow problem ⋮ An analogue of Hoffman's circulation conditions for max-balanced flows ⋮ Determining minimal cuts with a minimal number of arcs

This page was built for publication: Minimal cost flows in regular matroids

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3896865&oldid=17547128"