Minimization of Some Nonlinear Functions over Polymatroidal Network Flows

DOI10.1016/S0304-0208(08)72458-7zbMath0497.90021OpenAlexW12364848MaRDI QIDQ3962754

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

linear transformationsalgebraic contextindependent flowspolymatroidal flowsequivalent combinatorial structuresmin cost network flowsnegative cycle algorithmpolymatroid intersections with capacities

Mathematics Subject Classification ID

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

Related Items

An out-of-kilter method for submodular flows, Directed submodularity, ditroids and directed submodular flows, On the infinite Lucchesi–Younger conjecture I, Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization, Minimization on submodular flows, 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, Finding feasible vectors of Edmonds-Giles polyhedra