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

DOI10.1134/S096554251805010XzbMATH Open1405.90034OpenAlexW2807925151WikidataQ129726561 ScholiaQ129726561MaRDI QIDQ1662578FDOQ1662578

Authors: 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

Recommendations

• On methods for the convex multi-commodity flow problem
• Combinatorial approaches to multiflow problems
• New methods for multi-commodity flows
• Publication:3487111
• Criticality for multicommodity flows

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities
• Application of M-convex submodular flow problem to mathematical economics
• Convexity and starshapedness of feasible sets in stationary flow networks
• Solution of stochastic problems of assessing the feasibility of multicommodity flows
• An augmented Lagrangian approach to multi-commodity flow problems with conversions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662578)