On the public citation graph
Multicommodity network flows
0 signed · 96 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.
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.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/atr.1300openalex-snapshot
A traffic assignment model for a ridesharing transportation market
inferred← citeshttps://doi.org/10.1006/aama.1997.0549openalex-snapshot
AT-Approach to Some Results on Cuts and Metrics
inferred← citeshttps://doi.org/10.1006/eujc.1998.0246openalex-snapshot
Matroids with the Circuit Cover Property
inferred← citeshttps://doi.org/10.1006/jctb.2002.2128openalex-snapshot
Packing Odd Circuits in Eulerian Graphs
inferred← citeshttps://doi.org/10.1007/11944874_22openalex-snapshot
New Results on Rationality and Strongly Polynomial Time Solvability in Eisenberg-Gale Markets
inferred← citeshttps://doi.org/10.1007/3-540-45535-3_16openalex-snapshot
Integral Polyhedra Related to Even Cycle and Even Cut Matroids
inferred← citeshttps://doi.org/10.1007/3-540-69346-7_11openalex-snapshot
Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width
inferred← citeshttps://doi.org/10.1007/978-0-387-34881-0_8openalex-snapshot
Stochastic allocation of virtual paths to ATM links
inferred← citeshttps://doi.org/10.1007/978-3-0348-9112-7_16openalex-snapshot
Paths in Graphs and Curves on Surfaces
inferred← citeshttps://doi.org/10.1007/978-3-319-07557-0_1openalex-snapshot
The Cycling Property for the Clutter of Odd st-Walks
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_21openalex-snapshot
Correlation Clustering – Minimizing Disagreements on Arbitrary Weighted Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-45198-3_1openalex-snapshot
Correlation Clustering with Partial Information
inferred← citeshttps://doi.org/10.1007/978-3-540-45198-3_4openalex-snapshot
An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor
inferred← citeshttps://doi.org/10.1007/978-3-642-00142-0_50openalex-snapshot
Vehicle and Commodity Flow Synchronization
inferred← citeshttps://doi.org/10.1007/978-3-642-11110-5_7openalex-snapshot
Matroids and Combinatorial Optimisation
inferred← citeshttps://doi.org/10.1007/978-3-642-87729-2_7openalex-snapshot
Überblick über anwendungsbezogene Veröffentlichungen
inferred← citeshttps://doi.org/10.1007/bf01200755openalex-snapshot
An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
inferred← citeshttps://doi.org/10.1007/bf01200757openalex-snapshot
The geometry of graphs and some of its algorithmic applications
inferred← citeshttps://doi.org/10.1007/bf01305312openalex-snapshot
Improved Approximations for the Minimum-Cut Ratio and the Flux
inferred← citeshttps://doi.org/10.1007/bf01580600openalex-snapshot
On cuts and matchings in planar graphs
inferred← citeshttps://doi.org/10.1007/bf01582564openalex-snapshot
Dynamic factorization in large-scale optimization
inferred← citeshttps://doi.org/10.1007/bf01584987openalex-snapshot
A partitioning algorithm for the multicommodity network flow problem
inferred← citeshttps://doi.org/10.1007/bf02136158openalex-snapshot
Centralized and decentralized stochastic routing models in telecommunication networks
inferred← citeshttps://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/s00493-004-0031-xopenalex-snapshot
A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks
inferred← citeshttps://doi.org/10.1007/s00493-005-0015-5openalex-snapshot
Approximating Directed Multicuts
inferred← citeshttps://doi.org/10.1007/s12351-020-00564-8openalex-snapshot
The multicommodity network flow problem: state of the art classification, applications, and solution methods
inferred← citeshttps://doi.org/10.1007/s41109-021-00384-5openalex-snapshot
An analytical solution to the multicommodity network flow problem with weighted random routing
inferred← citeshttps://doi.org/10.1016/0012-365x(77)90053-xopenalex-snapshot
Classification de certaines matrices 0–1
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90228-2openalex-snapshot
Improved bounds for the max-flow min-multicut ratio for planar and K-free graphs
inferred← citeshttps://doi.org/10.1016/0024-3795(89)90450-3openalex-snapshot
Subspaces with well-scaled frames
inferred← citeshttps://doi.org/10.1016/0024-3795(89)90468-0openalex-snapshot
Polyhedra related to undirected multicommodity flows
inferred← citeshttps://doi.org/10.1016/0095-8956(89)90006-3openalex-snapshot
Distances and cuts in planar graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90052-lopenalex-snapshot
Short proofs on multicommodity flows and cuts
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-7204-2262-7.50031-4openalex-snapshot
Combinatorial Problems in Communication Networks††This paper was presented at the International Symposium on Combinatorial Mathematics, held at Colorado State University, Fort Collins, Colorado.
inferred← citeshttps://doi.org/10.1016/j.cor.2012.04.023openalex-snapshot
Decomposition's Dantzig–Wolfe applied to fuzzy multicommodity flow problems
inferred← citeshttps://doi.org/10.1016/j.dam.2015.10.035openalex-snapshot
A survey on flows in graphs and matroids
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.046openalex-snapshot
Mengerian quasi-graphical families and clutters
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.10.037openalex-snapshot
Minimal multicut and maximal integer multiflow: A survey
inferred← citeshttps://doi.org/10.1016/j.geb.2008.11.011openalex-snapshot
Eisenberg–Gale markets: Algorithms and game-theoretic properties
inferred← citeshttps://doi.org/10.1016/j.phycom.2008.06.001openalex-snapshot
Network capacity of cognitive radio relay network
inferred← citeshttps://doi.org/10.1016/j.ress.2006.11.004openalex-snapshot
A simple minimal path method for estimating the weighted multi-commodity multistate unreliable networks reliability
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.05.008openalex-snapshot
Correlation clustering in general weighted graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.06.003openalex-snapshot
On the hardness of finding near-optimal multicuts in directed acyclic graphs
inferred← citeshttps://doi.org/10.1016/j.tre.2010.05.002openalex-snapshot
Freight train scheduling with elastic demand
inferred← citeshttps://doi.org/10.1016/s0166-218x(87)80002-1openalex-snapshot
Half-integral five-terminus flows
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70459-xopenalex-snapshot
On Connectivity Properties of Eulerian Digraphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70822-7openalex-snapshot
Graph Theory and Integer Programming
inferred← citeshttps://doi.org/10.1016/s0195-6698(81)80033-9openalex-snapshot
Matroids and Multicommodity Flows
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00073-7openalex-snapshot
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00083-1openalex-snapshot
Projections of the capacitated network loading problem
inferred← citeshttps://doi.org/10.1016/s0898-1221(01)00149-3openalex-snapshot
Study on the multicommodity reliability of a capacitated-flow network
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01005-4openalex-snapshot
Chapter IV Network flows
inferred← citeshttps://doi.org/10.1023/a:1016231031814openalex-snapshot
A Concavity Result for Network Design Problems
inferred← citeshttps://doi.org/10.1051/ro/197509v300211openalex-snapshot
Résolution des problèmes de multiflots en nombres entiers dans les grands réseaux
inferred← citeshttps://doi.org/10.1057/jors.1978.196openalex-snapshot
A Note on Feasible Flows in Lower-Bounded Multicommodity Networks
inferred← citeshttps://doi.org/10.1109/ccnc.2012.6180996openalex-snapshot
A Min-Max multi-commodity flow model for wireless body area networks routing
inferred← citeshttps://doi.org/10.1109/comswa.2006.1665198openalex-snapshot
Multicommodity Flow Based Routing in Wireless Sensor Network with Lifetime Latency Tradeoff
inferred← citeshttps://doi.org/10.1109/fscs.1990.89595openalex-snapshot
Approximation through multicommodity flow
inferred← citeshttps://doi.org/10.1109/glocom.1991.188370openalex-snapshot
A neural network approach to the maximum flow problem
inferred← citeshttps://doi.org/10.1109/icpads.2006.67openalex-snapshot
Multicommodity flow based maximum lifetime routing in wireless sensor network
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303185openalex-snapshot
Request-service scheduling in dynamic communication networks
inferred← citeshttps://doi.org/10.1109/iscc.2015.7405556openalex-snapshot
Suggestion of routes for vehicles in vehicular networks using the multicommodity flow model
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365733openalex-snapshot
The geometry of graphs and some of its algorithmic applications
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959906openalex-snapshot
Approximating directed multicuts
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181974openalex-snapshot
Fast approximation algorithms for fractional Steiner forest and related problems
inferred← citeshttps://doi.org/10.1109/tr.2010.2055931openalex-snapshot
A New Universal Generating Function Method for Estimating the Novel Multiresource Multistate Information Network Reliability
inferred← citeshttps://doi.org/10.1109/tr.2011.2161030openalex-snapshot
A Sequential Decomposition Method for Estimating Flow in a Multi-Commodity, Multistate Network
inferred← citeshttps://doi.org/10.1111/j.1467-9574.2005.00286.xopenalex-snapshot
Optimization in telecommunication networks
inferred← citeshttps://doi.org/10.1137/070693072openalex-snapshot
Rationality and Strongly Polynomial Solvability of Eisenberg–Gale Markets with Two Agents
inferred← citeshttps://doi.org/10.1137/s0097539794285983openalex-snapshot
An O (log k ) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
inferred← citeshttps://doi.org/10.1137/s0895480196312334openalex-snapshot
Compact Representations of Cuts
inferred← citeshttps://doi.org/10.1137/s1052623496304542openalex-snapshot
Progress Made in Solving the Multicommodity Flow Problem
inferred← citeshttps://doi.org/10.1145/1013879.802662openalex-snapshot
A heuristic method for optimizing an intercity data transmission network
inferred← citeshttps://doi.org/10.1145/167088.167266openalex-snapshot
Approximate max-flow min-(multi)cut theorems and their applications
inferred← citeshttps://doi.org/10.1145/331524.331526openalex-snapshot
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
inferred← citeshttps://doi.org/10.1147/rd.134.0373openalex-snapshot
Maximal Biflow in an Undirected Network
inferred← citeshttps://doi.org/10.1287/inte.28.2.32openalex-snapshot
Advances in Solving the Multicommodity-Flow Problem
inferred← citeshttps://doi.org/10.1287/moor.27.4.693.299openalex-snapshot
Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids
inferred← citeshttps://doi.org/10.1287/opre.21.1.225openalex-snapshot
An Algorithm for Globally-Optimal Nonlinear-Cost Multidimensional Flows in Networks and Some Special Applications
inferred← citeshttps://doi.org/10.1287/opre.26.2.209openalex-snapshot
A Survey of Linear Cost Multicommodity Network Flows
inferred← citeshttps://doi.org/10.1287/opre.33.3.537openalex-snapshot
An Algorithm for the Maximal Multicommodity Funnel-Node Flow in an Undirected Network
inferred← citeshttps://doi.org/10.1287/trsc.32.2.110openalex-snapshot
Real-Time Optimization of Containers and Flatcars for Intermodal Operations
inferred← citeshttps://doi.org/10.1287/trsc.36.2.231.561openalex-snapshot
An Adaptive Dynamic Programming Algorithm for the Heterogeneous Resource Allocation Problem
inferred← citeshttps://doi.org/10.13140/rg.2.2.33981.00480openalex-snapshot
Quantum Bridge Analytics II: Network Optimization and Combinatorial Chaining for Asset Exchange
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.3233/inf-2001-12203openalex-snapshot
The Method for Solving a Piecewise-Linear Multicommodity Flow Problem
inferred← citeshttps://doi.org/10.47749/t/unicamp.2009.468406openalex-snapshot
Algoritmo para resolução do problema de fluxo multiproduto Fuzzy
inferred← citeshttps://doi.org/10.5540/tema.2008.09.01.0165openalex-snapshot
Uma Aplicação da Meta-heurística Híbrida Simulated Annealing-Iterated Local Search ao Problema de Fluxo Multiproduto sob o Espaço Capacitado
inferred← citeshttps://doi.org/10.5540/tema.2009.010.01.0041openalex-snapshot
Aplicação de Algoritmo Evolucionário Populacional ao Problema de Fluxo Multiproduto Inteiro
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.