The solution of the multi-product problem with integer-valued flows

DOI10.1016/0041-5553(82)90146-XMaRDI QIDQ4749573zbMATH OpenOpenAlexFDO

Authors Yu. E. Malashenko, A.-I. A. Stanevichyus

Publication date 1982

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

Full work available at URL https://doi.org/10.1016/0041-5553(82)90146-x

zbMATH Keywords

algorithmfeasibility probleminteger linear programnetwork with multi-commodity integer flowsshortest path problem in a graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Integer programming (90C10) Programming involving graphs or networks (90C35)

Cited in

(1)

• On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths

This page was built for publication: The solution of the multi-product problem with integer-valued flows

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