On the public citation graph

Two commodity network flows and linear programming

https://doi.org/10.1007/bf01584644
0 signed · 33 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1287/opre.11.3.344openalex-snapshot
Multi-Commodity Network Flows
inferredcites →https://doi.org/10.1287/opre.14.3.377openalex-snapshot
On Two Commodity Network Flows
inferredcites →https://doi.org/10.1287/opre.14.6.1121openalex-snapshot
Feasibility of Two Commodity Network Flows

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/1097-0037(200008)36:1<9::aid-net2>3.0.co;2-lopenalex-snapshot
A characterization of the two-commodity network design problem
inferred← citeshttps://doi.org/10.1002/net.3230070406openalex-snapshot
Unimodular matrices of flow problems with additional constraints
inferred← citeshttps://doi.org/10.1002/net.3230080107openalex-snapshot
Multicommodity network flows—A survey
inferred← citeshttps://doi.org/10.1002/net.3230140204openalex-snapshot
On multicommodity flows in planar graphs
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_3openalex-snapshot
Planar Graph Problems
inferred← citeshttps://doi.org/10.1007/bf01553903openalex-snapshot
Algorithms for multicommodity flows in planar graphs
inferred← citeshttps://doi.org/10.1007/bf01580455openalex-snapshot
Quasi-balanced matrices
inferred← citeshttps://doi.org/10.1007/s10589-008-9214-5openalex-snapshot
A new strategy for the undirected two-commodity maximum flow problem
inferred← citeshttps://doi.org/10.1007/s11590-023-02066-wopenalex-snapshot
A mathematical programming approach for recognizing binet matrices
inferred← citeshttps://doi.org/10.1016/0012-365x(77)90053-xopenalex-snapshot
Classification de certaines matrices 0–1
inferred← citeshttps://doi.org/10.1016/0024-3795(89)90450-3openalex-snapshot
Subspaces with well-scaled frames
inferred← citeshttps://doi.org/10.1016/0041-5553(80)90304-3openalex-snapshot
Acceleration of the convergence of the linearization method for the constrained minimization problem
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00111-4openalex-snapshot
Polynomial algorithms for (integral) maximum two-flows in vertex edge-capacitated planar graphs
inferred← citeshttps://doi.org/10.1016/0167-6377(94)90050-7openalex-snapshot
Two commodity flows
inferred← citeshttps://doi.org/10.1016/0377-2217(86)90302-4openalex-snapshot
The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
inferred← citeshttps://doi.org/10.1016/b978-0-12-398396-1.00022-2openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.11.012openalex-snapshot
The biobjective undirected two-commodity minimum cost flow problem
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.12.006openalex-snapshot
Integral biflow maximization
inferred← citeshttps://doi.org/10.1016/j.rtbm.2026.101736openalex-snapshot
Sustainable rural mobility: Strategic impact of integrating light rail into multimodal networks
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70553-3openalex-snapshot
References
inferred← citeshttps://doi.org/10.1080/03155986.1979.11731739openalex-snapshot
Maximization Of The Vector-Flow In Multigommodity Networks
inferred← citeshttps://doi.org/10.1137/0214023openalex-snapshot
An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks
inferred← citeshttps://doi.org/10.1137/1033075openalex-snapshot
Потоковые Алгоритмы (Flow Algorithms) (G. M. Adel’son-Vel’ski, E. A. Dinits, and A. V. Karzanov)
inferred← citeshttps://doi.org/10.1145/22145.22167openalex-snapshot
Multicommodity flows in planar undirected graphs and shortest paths
inferred← citeshttps://doi.org/10.1287/mnsc.23.9.994openalex-snapshot
An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
inferred← citeshttps://doi.org/10.1287/opre.26.2.209openalex-snapshot
A Survey of Linear Cost Multicommodity Network Flows
inferred← citeshttps://doi.org/10.2516/ogst:2000041openalex-snapshot
Optimisation du réseau algérien de transport de brut et de condensat
inferred← citeshttps://doi.org/10.3390/e24101485openalex-snapshot
Flows of Substances in Networks and Network Channels: Selected Results and Applications
inferred← citeshttps://doi.org/10.3934/jimo.2025027openalex-snapshot
Inflow-dependent quickest multi-commodity flow problem with partial lane reversals
inferred← citeshttps://doi.org/10.70675/85962bd5z65e0z4015z90c7zb8fec00fd809openalex-snapshot
Lagrangian Decomposition Methods for Large-Scale Fixed-Charge Capacitated Multicommodity Network Design Problem
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.