Minimization of Some Nonlinear Functions over Polymatroidal Network Flows

DOI10.1016/S0304-0208(08)72458-7MaRDI QIDQ3962754zbMATH OpenOpenAlexFDO

Authors Uwe T. Zimmermann

Publication date 1982

Published in North-Holland Mathematics Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-0208(08)72458-7

zbMATH Keywords

algebraic contextequivalent combinatorial structuresindependent flowslinear transformationsmin cost network flowsnegative cycle algorithmpolymatroid intersections with capacitiespolymatroidal flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Nonlinear programming (90C30) Programming involving graphs or networks (90C35)

Cited in

(9)

• An out-of-kilter method for submodular flows
• Directed submodularity, ditroids and directed submodular flows
• Minimization on submodular flows
• Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization
• Proving total dual integrality with cross-free families—A general framework
• Structures of polyhedra determined by submodular functions on crossing families
• Polymatroidal flows with lower bounds
• On the infinite Lucchesi–Younger conjecture I
• Finding feasible vectors of Edmonds-Giles polyhedra

This page was built for publication: Minimization of Some Nonlinear Functions over Polymatroidal Network Flows

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