Minimization on submodular flows

DOI10.1016/0166-218X(82)90053-1zbMath0491.90041OpenAlexW2006684953MaRDI QIDQ1167658

Uwe T. Zimmermann

Publication date: 1982

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(82)90053-1

zbMATH Keywords

semimodulessubmodular flowsnetwork circulationalgebraic linear functions over modulesauxiliary digraphexistence of group-valued submodular flowsnegative circuit methodquotients of linear functions over totally ordered commutative fieldsring-valued submodular flowssubmodular set constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Programming in abstract spaces (90C48)

Related Items

Linear and combinatorial sharing problems, A fast cost scaling algorithm for submodular flow, An out-of-kilter method for submodular flows, Sharing problems, An application of simultaneous diophantine approximation in combinatorial optimization, Fair integral submodular flows, Generalized polymatroids and submodular flows, Directed submodularity, ditroids and directed submodular flows, An application of submodular flows, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, A dual algorithm for submodular flow problems, A cost-scaling algorithm for \(0-1\) submodular flows, Negative circuits for flows and submodular flows, Structures of polyhedra determined by submodular functions on crossing families, Duality for balanced submodular flows

Cites Work

• Unnamed Item
• Linear and combinatorial optimization in ordered algebraic structures
• The ellipsoid method and its consequences in combinatorial optimization
• Minimization of Some Nonlinear Functions over Polymatroidal Network Flows
• Computing Maximal “Polymatroidal” Network Flows
• ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
• An Algorithm for Submodular Functions on Graphs
• On the maximal flow problem with real arc capacities