ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
From MaRDI portal
Publication:4168621
DOI10.15807/jorsj.21.189zbMath0388.05007OpenAlexW153872779MaRDI QIDQ4168621
Publication date: 1978
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.21.189
Deterministic network models in operations research (90B10) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
A fast cost scaling algorithm for submodular flow, An out-of-kilter method for submodular flows, Principal structure of submodular systems and Hitchcock-type independent flows, Generalized polymatroids and submodular flows, An application of submodular flows, Finding a Stable Allocation in Polymatroid Intersection, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations, On the infinite Lucchesi–Younger conjecture I, How to make a digraph strongly connected, Minimization on submodular flows, Extended random assignment mechanisms on a family of good sets, Negative circuits for flows and submodular flows, Proving total dual integrality with cross-free families—A general framework, Paths on polymatroids, Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions, New algorithms for the intersection problem of submodular systems, Adjacency on polymatroids, Structures of polyhedra determined by submodular functions on crossing families, Minimizing a sum of submodular functions, A capacity scaling algorithm for M-convex submodular flow, Structural theorems for submodular functions, polymatroids and polymatroid intersections, Some recent results in combinatorial approaches to dynamical systems, Boolean sublattices connected with minimization problems on matroids, Discrete convex analysis, Submodular optimization views on the random assignment problem, Finding feasible vectors of Edmonds-Giles polyhedra
