Two commodity network flows and linear programming

DOI10.1007/BF01584644MaRDI QIDQ5670422zbMATH OpenOpenAlexFDO

Authors M. Sakarovitch

Publication date 1973

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01584644

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites work

• Feasibility of Two Commodity Network Flows
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• Multi-Commodity Network Flows
• On Two Commodity Network Flows

Cited in

(13)

• The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
• Algorithms for multicommodity flows in planar graphs
• Subspaces with well-scaled frames
• Classification de certaines matrices 0-1
• Two commodity flows
• Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs
• Quasi-balanced matrices
• Multicommodity network flows: a survey. I: Applications and formulations
• Integral biflow maximization
• Inflow-dependent quickest multi-commodity flow problem with partial lane reversals
• A mathematical programming approach for recognizing binet matrices
• The biobjective undirected two-commodity minimum cost flow problem
• A new strategy for the undirected two-commodity maximum flow problem

This page was built for publication: Two commodity network flows and linear programming

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