On the public citation graph

Minimum cost multiflows in undirected networks

https://doi.org/10.1007/bf01581152
0 signed · 25 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.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01902503openalex-snapshot
On some connectivity properties of Eulerian graphs
inferredcites →https://doi.org/10.1007/bf02579369openalex-snapshot
A strongly polynomial minimum cost circulation algorithm
inferredcites →https://doi.org/10.1016/0024-3795(89)90468-0openalex-snapshot
Polyhedra related to undirected multicommodity flows
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/s0167-5060(08)70734-9openalex-snapshot
A Min-Max Relation for Submodular Functions on Graphs
inferredcites →https://doi.org/10.1145/76359.76368openalex-snapshot
Finding minimum-cost circulations by canceling negative cycles
inferredcites →https://doi.org/10.1287/opre.34.2.250openalex-snapshot
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
inferredcites →https://doi.org/10.21236/ada214689openalex-snapshot
Network Flow Algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-45587-7_32openalex-snapshot
On a General Framework for Network Representability in Discrete Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_11openalex-snapshot
A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
inferred← citeshttps://doi.org/10.1007/978-981-10-6147-9_4openalex-snapshot
Discrete Convex Functions on Graphs and Their Algorithmic Applications
inferred← citeshttps://doi.org/10.1007/bf01261321openalex-snapshot
Path problems in skew-symmetric graphs
inferred← citeshttps://doi.org/10.1007/bf02614372openalex-snapshot
Multiflows and disjoint paths of minimum total cost
inferred← citeshttps://doi.org/10.1007/s00291-022-00699-4openalex-snapshot
Cost minimizing planning of container inspection and repair in multiple facilities
inferred← citeshttps://doi.org/10.1007/s10107-011-0506-7openalex-snapshot
Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
inferred← citeshttps://doi.org/10.1007/s10107-021-01683-6openalex-snapshot
A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem
inferred← citeshttps://doi.org/10.1007/s10878-011-9377-3openalex-snapshot
Min-cost multiflows in node-capacitated undirected networks
inferred← citeshttps://doi.org/10.1007/s10878-017-0136-yopenalex-snapshot
On a general framework for network representability in discrete optimization
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.07.001openalex-snapshot
L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem
inferred← citeshttps://doi.org/10.1137/151004288openalex-snapshot
Approximating the Generalized Terminal Backup Problem via Half-Integral Multiflow Relaxation
inferred← citeshttps://doi.org/10.1137/20m1361857openalex-snapshot
Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity
inferred← citeshttps://doi.org/10.1145/3291531openalex-snapshot
A Dual Descent Algorithm for Node-capacitated Multiflow Problems and Its Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1001.0125openalex-snapshot
On Min-Cost Multiflow Problem in Node-Capacitated Undirected Networks
inferred← citeshttps://doi.org/10.5555/314464.314640openalex-snapshot
Path problems in skew-symmetric graphs
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.