Generalized lexicographically optimal flows in networks with multiple sources and sinks

DOI10.1080/00207728308926511zbMath0518.90015OpenAlexW1975707780MaRDI QIDQ3668257

Naonori Nishida, Hayashi, Yoichi

Publication date: 1983

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207728308926511

zbMATH Keywords

algorithmminimum cost flowlexicographically optimal multi-terminal flow problemssink optimal flowsource optimal flow

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
• Use of matroid theory in operations research, circuits and systems theory
• Optimal flows in networks with multiple sources and sinks
• The Sharing Problem
• A New Method of Constrained Optimization and a Comparison With Other Methods
• On some techniques useful for solution of transportation network problems

This page was built for publication: Generalized lexicographically optimal flows in networks with multiple sources and sinks