Methods of the convex cone theory in the feasibility problem of multicommodity flow

DOI10.1134/S096554251805010XzbMath1405.90034OpenAlexW2807925151WikidataQ129726561 ScholiaQ129726561MaRDI QIDQ1662578

Ya. R. Grinberg

Publication date: 20 August 2018

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s096554251805010x

zbMATH Keywords

polyhedral conemulticommodity flowfeasibility criterionmultivertex graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cites Work

• Step graphs and their application to the organization of commodity flows in networks
• The stability of the lexicographic maximin problem of the flow distribution in multiproduct networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Methods of the convex cone theory in the feasibility problem of multicommodity flow