On the public citation graph
A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
0 signed · 52 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 this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf02579369openalex-snapshot
A strongly polynomial minimum cost circulation algorithm
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.1057/jors.1981.67openalex-snapshot
Discrete Structures and Algorithms
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1287/moor.10.2.251openalex-snapshot
A Primal-Dual Algorithm for Submodular 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/net.22169openalex-snapshot
A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
inferred← citeshttps://doi.org/10.1006/jctb.2001.2072openalex-snapshot
A Fully Combinatorial Algorithm for Submodular Function Minimization
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_20openalex-snapshot
A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-32726-1_11openalex-snapshot
An Update-and-Stabilize Framework for the Minimum-Norm-Point Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-22160-0_7openalex-snapshot
Algorithms for Bicriteria Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1007/bf02579200openalex-snapshot
An application of simultaneous diophantine approximation in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/s10107-024-02077-0openalex-snapshot
An update-and-stabilize framework for the minimum-norm-point problem
inferred← citeshttps://doi.org/10.1007/s101070100253openalex-snapshot
A faster capacity scaling algorithm for minimum cost submodular flow
inferred← citeshttps://doi.org/10.1007/s13160-012-0085-xopenalex-snapshot
Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90025-jopenalex-snapshot
Two strongly polynomial cut cancelling algorithms for minimum cost network flow
inferred← citeshttps://doi.org/10.1016/0167-6377(86)90011-8openalex-snapshot
A dual version of tardos's algorithm for linear programming
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(87)90043-5openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0377-2217(93)e0348-2openalex-snapshot
The minimal average cost flow problem
inferred← citeshttps://doi.org/10.1016/j.dam.2014.07.005openalex-snapshot
About the minimum mean cycle-canceling algorithm
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80128-8openalex-snapshot
Chapter 11 Network reliability
inferred← citeshttps://doi.org/10.1080/02331939608844244openalex-snapshot
A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows
inferred← citeshttps://doi.org/10.1080/10556788.2014.895828openalex-snapshot
Minimum-cost flow algorithms: an experimental evaluation
inferred← citeshttps://doi.org/10.1137/1033048openalex-snapshot
Some Recent Advances in Network Flows
inferred← citeshttps://doi.org/10.1137/s0097539791221529openalex-snapshot
A Randomized Maximum-Flow Algorithm
inferred← citeshttps://doi.org/10.1137/s0097539792236729openalex-snapshot
Efficient Algorithms for the Hitchcock Transportation Problem
inferred← citeshttps://doi.org/10.1137/s0895480199361533openalex-snapshot
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow
inferred← citeshttps://doi.org/10.1145/28395.28397openalex-snapshot
Solving minimum-cost flow problems by successive approximation
inferred← citeshttps://doi.org/10.1145/42282.214090openalex-snapshot
An O (n 2 (m + N log n )log n ) min-cost flow algorithm
inferred← citeshttps://doi.org/10.1145/62212.62249openalex-snapshot
A faster strongly polynomial minimum cost flow algorithm
inferred← citeshttps://doi.org/10.1145/62212.62250openalex-snapshot
Finding minimum-cost circulations by canceling negative cycles
inferred← citeshttps://doi.org/10.1145/76359.76368openalex-snapshot
Finding minimum-cost circulations by canceling negative cycles
inferred← citeshttps://doi.org/10.11526/ieejjournal1888.107.5_389openalex-snapshot
II.ネットワークに関する解析•設計•運用技法
inferred← citeshttps://doi.org/10.11606/d.45.2007.tde-08052007-182205openalex-snapshot
Relações min-max em otimização combinatória
inferred← citeshttps://doi.org/10.1287/moor.14.1.60openalex-snapshot
A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems
inferred← citeshttps://doi.org/10.1287/moor.15.3.430openalex-snapshot
Finding Minimum-Cost Circulations by Successive Approximation
inferred← citeshttps://doi.org/10.1287/moor.16.2.272openalex-snapshot
Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
inferred← citeshttps://doi.org/10.1287/opre.1110.1025openalex-snapshot
Belief Propagation for Min-Cost Network Flow: Convergence and Correctness
inferred← citeshttps://doi.org/10.1287/opre.41.2.338openalex-snapshot
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
inferred← citeshttps://doi.org/10.15476/elte.2019.029openalex-snapshot
Efficient Algorithms for Graph Optimization Problems
inferred← citeshttps://doi.org/10.15807/jorsj.30.265openalex-snapshot
A POLYNOMIAL-TIME DUAL SIMPLEX ALGORITHM FOR THE MINIMUM COST FLOW PROBLEM
inferred← citeshttps://doi.org/10.15807/jorsj.33.157openalex-snapshot
A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS
inferred← citeshttps://doi.org/10.5555/314613.314696openalex-snapshot
A faster algorithm for minimum cost submodular flows
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.