Some remarks on convex network flows for \(K\)-spiders
From MaRDI portal
Publication:1666402
DOI10.1155/2015/710516zbMath1394.90158OpenAlexW1494755766WikidataQ59118995 ScholiaQ59118995MaRDI QIDQ1666402
Publication date: 27 August 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2015/710516
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cites Work
- Hardy-Littlewood-Polya's inequality and a new concept of weak majorization
- Monotonic properties of the least squares mean
- Fan's inequality in geodesic spaces
- An approach of majorization in spaces with a curved geometry
- Balance vertices in trees
- Majorization and distances in trees
- Inequalities between the Two Kinds of Eigenvalues of a Linear Transformation
- Inequalities: theory of majorization and its applications
- Convex functions and their applications. A contemporary approach
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Some remarks on convex network flows for \(K\)-spiders