On the public citation graph
Dual coordinate step methods for linear network flow problems
0 signed · 124 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.1002/net.3230140404openalex-snapshot
Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
inferredcites →https://doi.org/10.1007/978-0-387-74503-9openalex-snapshot
Linear and Nonlinear Programming
inferredcites →https://doi.org/10.1007/bf00934676openalex-snapshot
An iterative row-action method for interval convex programming
inferredcites →https://doi.org/10.1007/bf01585705openalex-snapshot
Finding minimum-cost flows by double scaling
inferredcites →https://doi.org/10.1007/bf01586039openalex-snapshot
On the computational behavior of a polynomial-time network flow algorithm
inferredcites →https://doi.org/10.1007/bf01586087openalex-snapshot
A unified framework for primal-dual methods in minimum cost network flow problems
inferredcites →https://doi.org/10.1007/bf02022089openalex-snapshot
Relaxation techniques for strictly convex network problems
inferredcites →https://doi.org/10.1007/bf02186476openalex-snapshot
The auction algorithm: A distributed relaxation method for the assignment problem
inferredcites →https://doi.org/10.1007/bf02186478openalex-snapshot
Nonlinear network optimization on a massively parallel connection machine
inferredcites →https://doi.org/10.1007/bf02278710openalex-snapshot
A shortest augmenting path algorithm for dense and sparse linear assignment problems
inferredcites →https://doi.org/10.1007/bf02579369openalex-snapshot
A strongly polynomial minimum cost circulation algorithm
inferredcites →https://doi.org/10.1007/bf02591967openalex-snapshot
Distributed asynchronous computation of fixed points
inferredcites →https://doi.org/10.1007/bfb0120964openalex-snapshot
On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
inferredcites →https://doi.org/10.1016/0020-0190(80)90021-6openalex-snapshot
Termination detection for diffusing computations
inferredcites →https://doi.org/10.1016/0041-5553(69)90061-5openalex-snapshot
Minimization of unsmooth functionals
inferredcites →https://doi.org/10.1016/0041-5553(81)90063-xopenalex-snapshot
Minimization of unsmooth functions
inferredcites →https://doi.org/10.1016/0378-4754(86)90092-3openalex-snapshot
Linear and nonlinear 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.1057/jors.1981.67openalex-snapshot
Discrete Structures and Algorithms
inferredcites →https://doi.org/10.1109/cdc.1985.268826openalex-snapshot
A distributed asynchronous relaxation algorithm for the assignment problem
inferredcites →https://doi.org/10.1109/cdc.1986.267433openalex-snapshot
Distributed 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.1109/tcom.1977.1093750openalex-snapshot
A Class of Decentralized Routing Algorithms Using Relaxation
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/0311049openalex-snapshot
A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
inferredcites →https://doi.org/10.1137/0325006openalex-snapshot
Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
inferredcites →https://doi.org/10.1137/0325067openalex-snapshot
Relaxation Methods for Network Flow Problems with Convex Arc Costs
inferredcites →https://doi.org/10.1145/12130.12144openalex-snapshot
A new approach to the maximum flow problem
inferredcites →https://doi.org/10.1145/28395.28397openalex-snapshot
Solving minimum-cost flow problems by successive approximation
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1145/4221.4227openalex-snapshot
Complexity of network synchronization
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.1287/mnsc.20.5.814openalex-snapshot
NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
inferredcites →https://doi.org/10.1287/opre.36.1.93openalex-snapshot
Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
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.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.1007/978-1-4612-0439-8_12openalex-snapshot
The Auction Algorithm for Assignment and Other Network Flow Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-3400-2_6openalex-snapshot
Parallel Algorithms for Network Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-3400-2_9openalex-snapshot
Parallel Cost Approximation Algorithms for Differentiable Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3632-7_2openalex-snapshot
Mathematical Equivalence of the Auction Algorithm for Assignment and the ∊-Relaxation (Preflow-Push) Method for Min Cost Flow
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_2openalex-snapshot
Linear Assignment Problems and Extensions
inferred← citeshttps://doi.org/10.1007/978-1-4757-6130-6_12openalex-snapshot
A Parallel Approximation Schema for Symmetric Linear Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-20828-2_6openalex-snapshot
Benamou-Brenier and other continuous numerical methods
inferred← citeshttps://doi.org/10.1007/978-3-319-20828-2_7openalex-snapshot
Functionals on the space of probabilities
inferred← citeshttps://doi.org/10.1007/978-3-540-73312-6_14openalex-snapshot
Parallel Auction Algorithm for Bus Rescheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-38267-3_38openalex-snapshot
A Hierarchical Approach to Optimal Transport
inferred← citeshttps://doi.org/10.1007/978-3-642-40020-9_42openalex-snapshot
A Comparison of Two Dual Methods for Discrete Optimal Transport
inferred← citeshttps://doi.org/10.1007/978-3-642-59179-2_6openalex-snapshot
ɛ-Relaxation and Auction Methods for Separable Convex Cost Network Flow Problems
inferred← citeshttps://doi.org/10.1007/bf00247653openalex-snapshot
Auction algorithms for network flow problems: A tutorial introduction
inferred← citeshttps://doi.org/10.1007/bf00249638openalex-snapshot
A forward/reverse auction algorithm for asymmetric assignment problems
inferred← citeshttps://doi.org/10.1007/bf01299157openalex-snapshot
A comparison of two algorithms for the assignment problem
inferred← citeshttps://doi.org/10.1007/bf01299446openalex-snapshot
Data parallel computing for network-structured optimization problems
inferred← citeshttps://doi.org/10.1007/bf01299450openalex-snapshot
A generic auction algorithm for the minimum cost network flow problem
inferred← citeshttps://doi.org/10.1007/bf01580904openalex-snapshot
On the convergence of the affine-scaling algorithm
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/bf01586040openalex-snapshot
New scaling algorithms for the assignment and minimum mean cycle problems
inferred← citeshttps://doi.org/10.1007/bf02216923openalex-snapshot
The auction algorithm for the transportation problem
inferred← citeshttps://doi.org/10.1007/pl00011379openalex-snapshot
An ε-relaxation method for separable convex cost generalized network flow problems
inferred← citeshttps://doi.org/10.1007/s00211-015-0780-zopenalex-snapshot
Far-field reflector problem and intersection of paraboloids
inferred← citeshttps://doi.org/10.1007/s00454-016-9757-7openalex-snapshot
Discrete Optimal Transport: Complexity, Geometry and Applications
inferred← citeshttps://doi.org/10.1007/s00521-023-08242-4openalex-snapshot
Modified arithmetic optimization algorithm for drones measurements and tracks assignment problem
inferred← citeshttps://doi.org/10.1007/s00521-024-09602-4openalex-snapshot
Optimum sensors allocation for drones multi-target tracking under complex environment using improved prairie dog optimization
inferred← citeshttps://doi.org/10.1007/s10878-017-0240-zopenalex-snapshot
Critical objective function values in linear sum assignment problems
inferred← citeshttps://doi.org/10.1007/s11042-023-15852-6openalex-snapshot
Transferability prediction among classification and regression tasks using optimal transport
inferred← citeshttps://doi.org/10.1007/s11590-021-01791-4openalex-snapshot
The assignment problem revisited
inferred← citeshttps://doi.org/10.1016/0005-1098(91)90003-kopenalex-snapshot
Some aspects of parallel and distributed iterative algorithms—A survey
inferred← citeshttps://doi.org/10.1016/0305-0548(93)90120-8openalex-snapshot
Spoke contour conversion for coverage diagrams
inferred← citeshttps://doi.org/10.1016/0360-8352(94)90033-7openalex-snapshot
Vectorization of an auction algorithm for linear cost assignment problem
inferred← citeshttps://doi.org/10.1016/0377-2217(91)90060-9openalex-snapshot
The maximum flow problem: A max-preflow approach
inferred← citeshttps://doi.org/10.1016/0743-7315(91)90092-nopenalex-snapshot
On the massively parallel solution of the assignment problem
inferred← citeshttps://doi.org/10.1016/0893-6080(94)90081-7openalex-snapshot
The invisible hand algorithm: Solving the assignment problem with statistical physics
inferred← citeshttps://doi.org/10.1016/bs.hna.2020.10.001openalex-snapshot
Optimal transport: discretization and algorithms
inferred← citeshttps://doi.org/10.1016/j.apor.2020.102177openalex-snapshot
Assign multiple AUVs to form a row efficiently based on a method of processing the cost matrix
inferred← citeshttps://doi.org/10.1016/j.cor.2005.05.022openalex-snapshot
A decision support system for the single-depot vehicle rescheduling problem
inferred← citeshttps://doi.org/10.1016/j.rico.2024.100383openalex-snapshot
New auction algorithms for the assignment problem and extensions
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00172-9openalex-snapshot
Algorithms and codes for dense assignment problems: the state of the art
inferred← citeshttps://doi.org/10.1016/s0167-8191(05)80062-6openalex-snapshot
Parallel synchronous and asynchronous implementations of the auction algorithm
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80122-7openalex-snapshot
Chapter 5 Parallel computing in network optimization
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01005-4openalex-snapshot
Chapter IV Network flows
inferred← citeshttps://doi.org/10.1023/a:1018358602892openalex-snapshot
Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets
inferred← citeshttps://doi.org/10.1023/a:1019629113986openalex-snapshot
Implementation and Test of Auction Methods for Solving Generalized Network Flow Problems with Separable Convex Cost
inferred← citeshttps://doi.org/10.1051/proc:2008032openalex-snapshot
Solving the Uniform Density Constraint in a Stochastic Downscaling Model
inferred← citeshttps://doi.org/10.1080/00207179.2017.1316016openalex-snapshot
A simple effective heuristic for embedded mixed-integer quadratic programming
inferred← citeshttps://doi.org/10.1080/10556788.2014.895828openalex-snapshot
Minimum-cost flow algorithms: an experimental evaluation
inferred← citeshttps://doi.org/10.1103/physrevd.102.116019openalex-snapshot
Linearized optimal transport for collider events
inferred← citeshttps://doi.org/10.1109/7.53448openalex-snapshot
Efficient algorithms for finding the K best paths through a trellis
inferred← citeshttps://doi.org/10.1109/71.862206openalex-snapshot
A parallel pruning technique for highly asymmetric assignment problems
inferred← citeshttps://doi.org/10.1109/acc.2016.7526551openalex-snapshot
A simple effective heuristic for embedded mixed-integer quadratic programming
inferred← citeshttps://doi.org/10.1109/allerton.2010.5707073openalex-snapshot
Distributed asynchronous policy iteration in dynamic programming
inferred← citeshttps://doi.org/10.1109/ccdc.2016.7531871openalex-snapshot
Zero element row augmenting path algorithm for linear assignment problems
inferred← citeshttps://doi.org/10.1109/cdc.2012.6426480openalex-snapshot
Accelerated dual coordinate algorithms for separable convex cost network flow problems
inferred← citeshttps://doi.org/10.1109/fmpc.1990.89444openalex-snapshot
Massively parallel auction algorithms for the assignment problem
inferred← citeshttps://doi.org/10.1109/ijcnn.1991.155168openalex-snapshot
Solving the assignment problem with statistical physics
inferred← citeshttps://doi.org/10.1109/tac.2017.2677879openalex-snapshot
Convergence Rate of Distributed ADMM Over Networks
inferred← citeshttps://doi.org/10.1137/0801026openalex-snapshot
An Auction Algorithm for Shortest Paths
inferred← citeshttps://doi.org/10.1137/0803013openalex-snapshot
Reverse Auction and the Solution of Inequality Constrained Assignment Problems
inferred← citeshttps://doi.org/10.1137/1033048openalex-snapshot
Some Recent Advances in Network Flows
inferred← citeshttps://doi.org/10.1137/16m1106018openalex-snapshot
Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
inferred← citeshttps://doi.org/10.1137/s0097539791199334openalex-snapshot
Improved Algorithms for Bipartite Network Flow
inferred← citeshttps://doi.org/10.1137/s1052623495285886openalex-snapshot
An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems
inferred← citeshttps://doi.org/10.1142/s0218202525500113openalex-snapshot
Approximation theory, computing, and deep learning on the Wasserstein space
inferred← citeshttps://doi.org/10.1145/2582112.2582153openalex-snapshot
Intersection of paraboloids and application to Minkowski-type problems
inferred← citeshttps://doi.org/10.1155/2020/1047369openalex-snapshot
Decentralizing Coordination in Open Vehicle Fleets for Scalable and Dynamic Task Allocation
inferred← citeshttps://doi.org/10.1287/ijoc.1040.0081openalex-snapshot
A Computational Study of Cost Reoptimization for Min-Cost Flow Problems
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.16.4.859openalex-snapshot
Relaxation Method for Large Scale Linear Programming Using Decomposition
inferred← citeshttps://doi.org/10.1287/trsc.35.2.165.10135openalex-snapshot
Models and Algorithms for Single-Depot Vehicle Scheduling
inferred← citeshttps://doi.org/10.1504/ijbra.2005.007911openalex-snapshot
Fast chromosome karyotyping by auction algorithm
inferred← citeshttps://doi.org/10.15476/elte.2019.029openalex-snapshot
Efficient Algorithms for Graph Optimization Problems
inferred← citeshttps://doi.org/10.1561/9781680835519openalex-snapshot
Computational Optimal Transport
inferred← citeshttps://doi.org/10.15807/jorsj.38.124openalex-snapshot
AN EFFICIENT COST SCALING ALGORITHM FOR THE INDEPENDENT ASSIGNMENT PROBLEM
inferred← citeshttps://doi.org/10.2514/1.a35685openalex-snapshot
Regional Constellation Reconfiguration Problem: Integer Linear Programming Formulation and Lagrangian Heuristic Method
inferred← citeshttps://doi.org/10.4310/cis.2008.v8.n3.a5openalex-snapshot
An Optimal Distributed Routing Algorithm using Dual Decomposition Techniques
inferred← citeshttps://doi.org/10.48550/arxiv.1510.08956openalex-snapshot
Principal Differences Analysis: Interpretable Characterization of Differences between Distributions
inferred← citeshttps://doi.org/10.48550/arxiv.2101.07155openalex-snapshot
Revisiting the Auction Algorithm for Weighted Bipartite Perfect Matchings
inferred← citeshttps://doi.org/10.70675/9b934542za9daz4af4z92d1z34cac984ce43openalex-snapshot
Asymptotical estimates for some algorithms for data and image processing : a study of the Sinkhorn algorithm and a numerical analysis of total variation minimization
inferred← citeshttps://doi.org/10.70675/cc966201z7d92z4de4zabc8zbf8370e6f5b0openalex-snapshot
Projection in the 2-Wasserstein sense on structured measure space
inferred← citeshttps://doi.org/10.70675/f31c86baz0ae1z4bfdz8fe6z1c8c4ca9b30eopenalex-snapshot
Quantitative Stability in Quadratic Optimal Transport
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.