On the public citation graph
Finding minimum-cost flows by double scaling
0 signed · 138 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/bf01580132openalex-snapshot
A bad network problem for the simplex method and other minimum cost flow algorithms
inferredcites →https://doi.org/10.1007/bf02579369openalex-snapshot
A strongly polynomial minimum cost circulation algorithm
inferredcites →https://doi.org/10.1007/bfb0121050openalex-snapshot
On the simplex algorithm for networks and generalized networks
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/0022-0000(85)90039-xopenalex-snapshot
Scaling algorithms for network problems
inferredcites →https://doi.org/10.1016/b978-0-08-031829-5.50005-1openalex-snapshot
MATHEMATICAL PROGRAMMING
inferredcites →https://doi.org/10.1016/s1474-6670(17)55135-6openalex-snapshot
Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1137/0217010openalex-snapshot
An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
inferredcites →https://doi.org/10.1137/0218065openalex-snapshot
Improved Time Bounds for the Maximum Flow Problem
inferredcites →https://doi.org/10.1137/0218069openalex-snapshot
Faster Scaling Algorithms for Network Problems
inferredcites →https://doi.org/10.1137/0325006openalex-snapshot
Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.1145/62212.62249openalex-snapshot
A faster strongly polynomial minimum cost flow algorithm
inferredcites →https://doi.org/10.1145/76359.76368openalex-snapshot
Finding minimum-cost circulations by canceling negative cycles
inferredcites →https://doi.org/10.1287/mnsc.5.3.304openalex-snapshot
On a Class of Capacitated Transportation Problems
inferredcites →https://doi.org/10.1287/moor.15.3.430openalex-snapshot
Finding Minimum-Cost Circulations by Successive Approximation
inferredcites →https://doi.org/10.1287/opre.37.5.748openalex-snapshot
A Fast and Simple Algorithm for the Maximum Flow Problem
inferredcites →https://doi.org/10.21236/ada457044openalex-snapshot
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
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.1002/net.3230250207openalex-snapshot
A capacity scaling algorithm for the constrained maximum flow problem
inferred← citeshttps://doi.org/10.1006/jagm.1993.1048openalex-snapshot
Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network
inferred← citeshttps://doi.org/10.1007/978-3-030-04651-4_11openalex-snapshot
Editing Graphs to Satisfy Diversity Requirements
inferred← citeshttps://doi.org/10.1007/978-3-031-18283-9_17openalex-snapshot
Hide & Seek: Privacy-Preserving Rebalancing on Payment Channel Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_59openalex-snapshot
A Simple Efficient Interior Point Method for Min-Cost Flow
inferred← citeshttps://doi.org/10.1007/978-3-319-41618-2_1openalex-snapshot
Flow Tasks in Networks in Crisp Conditions
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_58openalex-snapshot
A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24838-5_16openalex-snapshot
Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_49openalex-snapshot
Finding Paths with Minimum Shared Edges
inferred← citeshttps://doi.org/10.1007/978-3-642-25870-1_13openalex-snapshot
Parameterized Complexity of Eulerian Deletion Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-36279-8_10openalex-snapshot
Multi-agent Path Planning and Network Flow
inferred← citeshttps://doi.org/10.1007/bf01240734openalex-snapshot
Tight bounds on the number of minimum-mean cycle cancellations and related results
inferred← citeshttps://doi.org/10.1007/bf01582057openalex-snapshot
A technique for speeding up the solution of the Lagrangean dual
inferred← citeshttps://doi.org/10.1007/bf01586039openalex-snapshot
On the computational behavior of a polynomial-time network flow algorithm
inferred← citeshttps://doi.org/10.1007/bf01589405openalex-snapshot
Dual coordinate step methods for linear network flow problems
inferred← citeshttps://doi.org/10.1007/bf01940880openalex-snapshot
Algorithms for Dense Graphs and Networks on the Random Access Computer
inferred← citeshttps://doi.org/10.1007/bf02614365openalex-snapshot
A polynomial time primal network simplex algorithm for minimum cost flows
inferred← citeshttps://doi.org/10.1007/bf02614370openalex-snapshot
How to compute least infeasible flows
inferred← citeshttps://doi.org/10.1007/bfb0049391openalex-snapshot
Optimization algorithms for large networks
inferred← citeshttps://doi.org/10.1007/s001860200202openalex-snapshot
On dual minimum cost flow algorithms
inferred← citeshttps://doi.org/10.1007/s00224-017-9776-7openalex-snapshot
Minimum-Cost Flows in Unit-Capacity Networks
inferred← citeshttps://doi.org/10.1007/s00453-012-9667-xopenalex-snapshot
Parameterized Complexity of Eulerian Deletion Problems
inferred← citeshttps://doi.org/10.1007/s00453-014-9927-zopenalex-snapshot
The Minimum Vulnerability Problem
inferred← citeshttps://doi.org/10.1007/s10107-010-0378-2openalex-snapshot
Separation, dimension, and facet algorithms for node flow polyhedra
inferred← citeshttps://doi.org/10.1007/s10107-025-02321-1openalex-snapshot
On the connected (sub)partition polytope
inferred← citeshttps://doi.org/10.1007/s101070100260openalex-snapshot
Approximating the single source unsplittable min-cost flow problem
inferred← citeshttps://doi.org/10.1007/s10288-005-0078-6openalex-snapshot
Complexity and algorithms for convex network optimization and other nonlinear problems
inferred← citeshttps://doi.org/10.1007/s10586-015-0467-3openalex-snapshot
A data transmission algorithm for distributed computing system based on maximum flow
inferred← citeshttps://doi.org/10.1007/s10878-012-9462-2openalex-snapshot
Finding paths with minimum shared edges
inferred← citeshttps://doi.org/10.1007/s12597-012-0069-2openalex-snapshot
Flow constrained minimum cost flow problem
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90032-qopenalex-snapshot
A natural randomization strategy for multicommodity flow and related algorithms
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.05.006openalex-snapshot
Chips on wafers, or packing rectangles into grids
inferred← citeshttps://doi.org/10.1016/j.cor.2006.07.009openalex-snapshot
A double scaling algorithm for the constrained maximum flow problem
inferred← citeshttps://doi.org/10.1016/j.cor.2008.01.001openalex-snapshot
An exterior simplex type algorithm for the Minimum Cost Network Flow Problem
inferred← citeshttps://doi.org/10.1016/j.cor.2010.11.006openalex-snapshot
Minimal-cost network flow problems with variable lower bounds on arc flows
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.02.031openalex-snapshot
A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.11.014openalex-snapshot
Executability of scenarios in Petri nets
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.03.042openalex-snapshot
An O(m(m+nlogn)log(nC)) -time algorithm to solve the minimum cost tension problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.12.036openalex-snapshot
Finding optimal non-datapath caching strategies via network flow
inferred← citeshttps://doi.org/10.1016/j.tra.2012.10.027openalex-snapshot
Network design model with evacuation constraints
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00052-1openalex-snapshot
A fast cost scaling algorithm for submodular flow
inferred← citeshttps://doi.org/10.1016/s0167-6377(99)00047-4openalex-snapshot
A new scaling algorithm for the minimum cost network flow problem
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01005-4openalex-snapshot
Chapter IV Network flows
inferred← citeshttps://doi.org/10.1023/b:coap.0000033966.31088.98openalex-snapshot
An O(T log T) Algorithm for the Dynamic Lot Size Problem with Limited Storage and Linear Costs
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2602099openalex-snapshot
A new algorithm for minimizing makespan, Cmax, in blocking flow-shop problem through slowing down the operations
inferred← citeshttps://doi.org/10.1080/10556788.2014.895828openalex-snapshot
Minimum-cost flow algorithms: an experimental evaluation
inferred← citeshttps://doi.org/10.1108/17427370780000142openalex-snapshot
Energy‐efficient capacity‐constrained routing in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/43.640618openalex-snapshot
Timing-driven placement for regular architectures
inferred← citeshttps://doi.org/10.1109/dac.2002.1012693openalex-snapshot
An algorithm for integrated pin assignment and buffer planning
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00064openalex-snapshot
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
inferred← citeshttps://doi.org/10.1109/iccad.2001.968623openalex-snapshot
An algorithm for simultaneous pin assignment and routing
inferred← citeshttps://doi.org/10.1109/iccad.2003.159716openalex-snapshot
A min-cost flow based detailed router for FPGAs
inferred← citeshttps://doi.org/10.1109/iccv.2009.5459199openalex-snapshot
Fast and robust Earth Mover's Distances
inferred← citeshttps://doi.org/10.1109/icicdt.2009.5166267openalex-snapshot
Network flow based BSM asssignment
inferred← citeshttps://doi.org/10.1109/infcom.2007.31openalex-snapshot
Lexicographic Fairness in WDM Optical Cross-Connects
inferred← citeshttps://doi.org/10.1109/mass.2010.5664029openalex-snapshot
Energy-efficient data redistribution in sensor networks
inferred← citeshttps://doi.org/10.1109/milcom.1999.822783openalex-snapshot
Preventing traffic analysis for real-time communication networks
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267785openalex-snapshot
Newton's method for fractional combinatorial optimization
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646131openalex-snapshot
Improved approximation algorithms for unsplittable flow problems
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892073openalex-snapshot
Approximating the single source unsplittable min-cost flow problem
inferred← citeshttps://doi.org/10.1109/tcad.2003.814258openalex-snapshot
Min-cost flow-based algorithm for simultaneous pin assignment and routing
inferred← citeshttps://doi.org/10.1111/itor.12845openalex-snapshot
DEA‐based centralized resource allocation with network flows
inferred← citeshttps://doi.org/10.1137/0218065openalex-snapshot
Improved Time Bounds for the Maximum Flow Problem
inferred← citeshttps://doi.org/10.1137/1033048openalex-snapshot
Some Recent Advances in Network Flows
inferred← citeshttps://doi.org/10.1137/s0097539799355314openalex-snapshot
Approximation Algorithms for Single-Source Unsplittable Flow
inferred← citeshttps://doi.org/10.1142/s0218488511006897openalex-snapshot
A NEW APPROACH FOR SOLVING THE MINIMUM COST FLOW PROBLEM WITH INTERVAL AND FUZZY DATA
inferred← citeshttps://doi.org/10.1145/103418.103425openalex-snapshot
Fast approximation algorithms for multicommodity flow problems
inferred← citeshttps://doi.org/10.1145/1064546.1180614openalex-snapshot
Implementing approximation algorithms for the single-source unsplittable flow problem
inferred← citeshttps://doi.org/10.1145/1080334.1080340openalex-snapshot
An algorithm for integrated pin assignment and buffer planning
inferred← citeshttps://doi.org/10.1145/1374376.1374441openalex-snapshot
Faster approximate lossy generalized flow via interior point algorithms
inferred← citeshttps://doi.org/10.1145/225058.225267openalex-snapshot
Short length versions of Menger's theorem
inferred← citeshttps://doi.org/10.1145/2422966.2422968openalex-snapshot
Energy-efficient data redistribution in sensor networks
inferred← citeshttps://doi.org/10.1145/2451916.2451954openalex-snapshot
Network flow based datapath bit slicing
inferred← citeshttps://doi.org/10.1145/2593069.2593207openalex-snapshot
Row Based Dual-VDD Island Generation and Placement
inferred← citeshttps://doi.org/10.1145/3728631openalex-snapshot
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
inferred← citeshttps://doi.org/10.1145/513918.514067openalex-snapshot
An algorithm for integrated pin assignment and buffer planning
inferred← citeshttps://doi.org/10.1145/611817.611828openalex-snapshot
Wire type assignment for FPGA routing
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.1155/2014/480127openalex-snapshot
On the Transformation Mechanism for Formulating a Multiproduct Two‐Layer Supply Chain Network Design Problem as a Network Flow Model
inferred← citeshttps://doi.org/10.1175/jpo-d-16-0074.1openalex-snapshot
On the Minimum Potential Energy State and the Eddy Size–Constrained APE Density
inferred← citeshttps://doi.org/10.1186/1471-2105-15-s9-s5openalex-snapshot
On the complexity of Minimum Path Cover with Subpath Constraints for multi-assembly
inferred← citeshttps://doi.org/10.12691/ajams-7-6-1openalex-snapshot
The Fuzzy Minimum Cost Flow Problem with the Fuzzy Time-Windows
inferred← citeshttps://doi.org/10.1287/inte.20.4.133openalex-snapshot
The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial
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.40.1.s5openalex-snapshot
The Scaling Network Simplex Algorithm
inferred← citeshttps://doi.org/10.1287/opre.41.2.338openalex-snapshot
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
inferred← citeshttps://doi.org/10.1287/opre.46.2.231openalex-snapshot
A Scaling Algorithm for Multicommodity Flow Problems
inferred← citeshttps://doi.org/10.15476/elte.2019.029openalex-snapshot
Efficient Algorithms for Graph Optimization Problems
inferred← citeshttps://doi.org/10.15807/jorsj.47.244openalex-snapshot
A SURVEY OF COMBINATORIAL MAXIMUM FLOW ALGORITHMS ON A NETWORK WITH GAINS( Network Design, Control and Optimization)
inferred← citeshttps://doi.org/10.18642/jmsaa_7100121950openalex-snapshot
AN ALGORITHM OF A MINIMUM COST FLOW PROBLEM WITH TIME-VARYING AND TIME-WINDOWS
inferred← citeshttps://doi.org/10.21236/ada459506openalex-snapshot
A Technique for Speeding Up the Solution of the Lagrangean Dual
inferred← citeshttps://doi.org/10.21236/ada459686openalex-snapshot
A Capacity Scaling Algorithm for the Constrained Maximum Flow Problem
inferred← citeshttps://doi.org/10.2298/yjor121120001sopenalex-snapshot
Minimum cost network flows: Problems, algorithms, and software
inferred← citeshttps://doi.org/10.23919/date48585.2020.9116527openalex-snapshot
Self-Aligned Double-Patterning Aware Legalization
inferred← citeshttps://doi.org/10.3233/fi-1997-323406openalex-snapshot
Transition-optimal Token Distribution
inferred← citeshttps://doi.org/10.3390/fi9040095openalex-snapshot
SCMC: An Efficient Scheme for Minimizing Energy in WSNs Using a Set Cover Approach
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.26openalex-snapshot
Balanced Crown Decomposition for Connectivity Constraints
inferred← citeshttps://doi.org/10.4236/ajor.2017.71005openalex-snapshot
Quantification of Node Wise Commodity in Supply Chain and Its Cost Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.1207.6381openalex-snapshot
Efficient implementations of minimum-cost flow algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1606.07425openalex-snapshot
Generalized Preconditioning and Network Flow Problems
inferred← citeshttps://doi.org/10.5555/1129601.1129708openalex-snapshot
A routing algorithm for flip-chip design
inferred← citeshttps://doi.org/10.5555/127787.127812openalex-snapshot
Tight bounds on the number of minimum-mean cycle cancellations and related results
inferred← citeshttps://doi.org/10.5555/191326.191379openalex-snapshot
Compression-relaxation: a new approach to performance driven placement for regular architectures
inferred← citeshttps://doi.org/10.5555/313852.314105openalex-snapshot
A polynomial time primal network simplex algorithm for minimum cost flows
inferred← citeshttps://doi.org/10.5555/996070.1009920openalex-snapshot
A Min-Cost Flow Based Detailed Router for FPGAs
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.