Minimization on submodular flows

DOI10.1016/0166-218X(82)90053-1MaRDI QIDQ1167658zbMATH OpenOpenAlexFDO

Authors 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

algebraic linear functions over modulesauxiliary digraphexistence of group-valued submodular flowsnegative circuit methodnetwork circulationquotients of linear functions over totally ordered commutative fieldsring-valued submodular flowssemimodulessubmodular flowssubmodular set constraints

Mathematics Subject Classification ID

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

Cites work

• ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
• An Algorithm for Submodular Functions on Graphs
• Computing Maximal “Polymatroidal” Network Flows
• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• Linear and combinatorial optimization in ordered algebraic structures
• Minimization of Some Nonlinear Functions over Polymatroidal Network Flows
• On the maximal flow problem with real arc capacities
• The ellipsoid method and its consequences in combinatorial optimization

Cited in

(16)

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

This page was built for publication: Minimization on submodular flows

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