Methods of the convex cone theory in the feasibility problem of multicommodity flow
type: Item
instance of: scholarly article
title: Methods of the convex cone theory in the feasibility problem of multicommodity flow
zbMATH Open document ID: 1405.90034
DOI: 10.1134/S096554251805010X
author: Ya. R. Grinberg
published in: Computational Mathematics and Mathematical Physics
publication date: 2018-08-20T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6920543
zbMATH Keywords: multicommodity flow
zbMATH Keywords: feasibility criterion
zbMATH Keywords: polyhedral cone
zbMATH Keywords: multivertex graph
MaRDI profile type: Publication
cites work: Q5514188
cites work: Q3856789
cites work: Q3934130
cites work: Q4391068
cites work: The stability of the lexicographic maximin problem of the flow distribution in multiproduct networks
cites work: Q4242566
cites work: Q3818127
cites work: Step graphs and their application to the organization of commodity flows in networks
full work available at URL: s096554251805010x
OpenAlex ID: W2807925151
Wikidata QID: Q129726561
description: scientific article; zbMATH DE number 6920543