Minimal cost flows in regular matroids

DOI10.1007/BFB0120919MaRDI QIDQ3896865zbMATH OpenFDO

Authors Rainer E. Burkard, Horst W. Hamacher

Publication date 1981

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

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

zbMATH Keywords

admissible transformationsalgorithmsdetermination of maximal matroid flowHungarian methodlinear assignment problemsminimal cost flowsnegative circuitsoptimal matroid flowregular matroidsshortest augmenting circuitstransformation method

Mathematics Subject Classification ID

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

Cited in

(12)

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

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

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