Methods of the convex cone theory in the feasibility problem of multicommodity flow
From MaRDI portal
Publication:1662578
Recommendations
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3657831 (Why is no real title available?)
- scientific article; zbMATH DE number 3750660 (Why is no real title available?)
- scientific article; zbMATH DE number 1286020 (Why is no real title available?)
- scientific article; zbMATH DE number 1157096 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- 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
Cited in
(5)- An augmented Lagrangian approach to multi-commodity flow problems with conversions
- Application of M-convex submodular flow problem to mathematical economics
- Convexity and starshapedness of feasible sets in stationary flow networks
- Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities
- Solution of stochastic problems of assessing the feasibility of multicommodity flows
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)