Some Remarks on Convex Network Flows for K-Spiders

Some Remarks on Convex Network Flows for K-Spiders

We consider convex functions modeling flows in an arborescent network. The notion of majorization on trees is used to study some classical convexity results in this framework.

Bibliographic Details
Main Authors: Maria Mălin, Ionel Rovenţa
Format: Article
Language:English
Published: Hindawi Limited 2015-01-01
Series:Mathematical Problems in Engineering
Online Access:http://dx.doi.org/10.1155/2015/710516
id doaj-353d860cfac0420683496841dcd65203
record_format Article
spelling doaj-353d860cfac0420683496841dcd652032020-11-24T23:01:35ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472015-01-01201510.1155/2015/710516710516Some Remarks on Convex Network Flows for K-SpidersMaria Mălin0Ionel Rovenţa1Department of Mathematics, University of Craiova, A.I. Cuza Street No. 13, 200585 Craiova, RomaniaDepartment of Mathematics, University of Craiova, A.I. Cuza Street No. 13, 200585 Craiova, RomaniaWe consider convex functions modeling flows in an arborescent network. The notion of majorization on trees is used to study some classical convexity results in this framework.http://dx.doi.org/10.1155/2015/710516
collection DOAJ
language English
format Article
sources DOAJ
author Maria Mălin
Ionel Rovenţa
spellingShingle Maria Mălin
Ionel Rovenţa
Some Remarks on Convex Network Flows for K-Spiders
Mathematical Problems in Engineering
author_facet Maria Mălin
Ionel Rovenţa
author_sort Maria Mălin
title Some Remarks on Convex Network Flows for K-Spiders
title_short Some Remarks on Convex Network Flows for K-Spiders
title_full Some Remarks on Convex Network Flows for K-Spiders
title_fullStr Some Remarks on Convex Network Flows for K-Spiders
title_full_unstemmed Some Remarks on Convex Network Flows for K-Spiders
title_sort some remarks on convex network flows for k-spiders
publisher Hindawi Limited
series Mathematical Problems in Engineering
issn 1024-123X
1563-5147
publishDate 2015-01-01
description We consider convex functions modeling flows in an arborescent network. The notion of majorization on trees is used to study some classical convexity results in this framework.
url http://dx.doi.org/10.1155/2015/710516
work_keys_str_mv AT mariamalin someremarksonconvexnetworkflowsforkspiders
AT ionelroventa someremarksonconvexnetworkflowsforkspiders
_version_ 1725639004958752768

Similar Items