An out-of-kilter method for submodular flows

DOI10.1016/0166-218X(87)90003-5zbMath0632.90023MaRDI QIDQ1095780

Satoru Fujishige

Publication date: 1987

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

zbMATH Keywords

sensitivity analysisminimum-cost submodular network flowout-of-kilter algorithm

Mathematics Subject Classification ID

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

Related Items

A fast cost scaling algorithm for submodular flow, Optimization over the polyhedron determined by a submodular function on a co-intersecting family, A dual algorithm for submodular flow problems, New algorithms for the intersection problem of submodular systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding feasible vectors of Edmonds-Giles polyhedra
• Minimization on submodular flows
• A submodular network simplex method
• A NOTE ON SUBMODULAR FUNCTIONS ON DISTRIBUTIVE LATTICES
• Structures of polyhedra determined by submodular functions on crossing families
• A Primal-Dual Algorithm for Submodular Flows
• Submodular systems and related topics
• Minimum cost flow with set-constraints
• Minimization of Some Nonlinear Functions over Polymatroidal Network Flows
• Computing Maximal “Polymatroidal” Network Flows
• ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
• A Minimax Theorem for Directed Graphs