On the public citation graph
Relaxation Methods for Network Flow Problems with Convex Arc Costs
0 signed · 115 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/978-3-662-03995-3_15openalex-snapshot
Linear and nonlinear programming
inferredcites →https://doi.org/10.1007/bf00934779openalex-snapshot
On the convergence of sequential minimization algorithms
inferredcites →https://doi.org/10.1007/bf01584660openalex-snapshot
On search directions for minimization algorithms
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/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/0378-4754(86)90092-3openalex-snapshot
Linear and nonlinear programming.
inferredcites →https://doi.org/10.1109/cdc.1986.267433openalex-snapshot
Distributed relaxation methods for linear network flow 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.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
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.2307/2005111openalex-snapshot
Computational Methods in Optimization: A Unified Approach
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.2307/2343701openalex-snapshot
Nonlinear Programming: A Unified Approach.
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.3230200405openalex-snapshot
Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities
inferred← citeshttps://doi.org/10.1002/net.3230210407openalex-snapshot
Computational development of a lagrangian dual approach for quadratic networks
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0124openalex-snapshot
Asynchronous Iterative Algorithms with Flexible Communication for Nonlinear Network Flow Problems
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_497openalex-snapshot
Stochastic Network Problems: Massively Parallel Solution
inferred← citeshttps://doi.org/10.1007/3-540-61310-2_7openalex-snapshot
An ε-Relaxation method for generalized separable convex cost network flow problems
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_653openalex-snapshot
Stochastic Network Problems: Massively Parallel Solution
inferred← citeshttps://doi.org/10.1007/978-1-4615-5197-3_7openalex-snapshot
A Partitioned ∈-Relaxation Algorithm for Separable Convex Network Flow Problems
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/978-3-642-77489-8_5openalex-snapshot
The Linear Assignment Problem
inferred← citeshttps://doi.org/10.1007/bf00248264openalex-snapshot
Asynchronous gradient algorithms for a class of convex separable network flow problems
inferred← citeshttps://doi.org/10.1007/bf00248762openalex-snapshot
Application of the dual active set algorithm to quadratic network optimization
inferred← citeshttps://doi.org/10.1007/bf00248763openalex-snapshot
Proximal minimizations with D-functions and the massively parallel solution of linear network programs
inferred← citeshttps://doi.org/10.1007/bf00939948openalex-snapshot
On the convergence of the coordinate descent method for convex differentiable minimization
inferred← citeshttps://doi.org/10.1007/bf00940050openalex-snapshot
Asymptotic properties of the fenchel dual functional and applications to decomposition problems
inferred← citeshttps://doi.org/10.1007/bf00940507openalex-snapshot
Decomposition algorithm for convex differentiable minimization
inferred← citeshttps://doi.org/10.1007/bf00941397openalex-snapshot
Descent methods for convex essentially smooth minimization
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/bf01582253openalex-snapshot
Matrix scaling, entropy minimization, and conjugate duality (II): The dual problem
inferred← citeshttps://doi.org/10.1007/bf01585734openalex-snapshot
Relaxation methods for monotropic programs
inferred← citeshttps://doi.org/10.1007/bf01589405openalex-snapshot
Dual coordinate step methods for linear network flow problems
inferred← citeshttps://doi.org/10.1007/bf02097809openalex-snapshot
Models for multimode multicommodity location problems with interdepot balancing requirements
inferred← citeshttps://doi.org/10.1007/bf02110041openalex-snapshot
Proximal decomposition for multicommodity flow problems with convex costs
inferred← citeshttps://doi.org/10.1007/bf02186476openalex-snapshot
The auction algorithm: A distributed relaxation method for the assignment problem
inferred← citeshttps://doi.org/10.1007/bf02186478openalex-snapshot
Nonlinear network optimization on a massively parallel connection machine
inferred← citeshttps://doi.org/10.1007/bf02187645openalex-snapshot
Network games; adaptations to Nash-Cournot equilibrium
inferred← citeshttps://doi.org/10.1007/bf02288322openalex-snapshot
The relax codes for linear minimum cost network flow problems
inferred← citeshttps://doi.org/10.1007/bf02592017openalex-snapshot
Relaxation methods for problems with strictly convex separable costs and linear constraints
inferred← citeshttps://doi.org/10.1007/bf02592213openalex-snapshot
Solving multistage stochastic network programs on massively parallel computers
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/s10107-016-1034-2openalex-snapshot
On the linear convergence of the alternating direction method of multipliers
inferred← citeshttps://doi.org/10.1016/0167-8191(92)90016-zopenalex-snapshot
Data structures for network algorithms on massively parallel architectures
inferred← citeshttps://doi.org/10.1016/0305-0548(93)90069-uopenalex-snapshot
On the dual coordinate ascent approach for nonlinear networks
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90046-popenalex-snapshot
A unified description of iterative algorithms for traffic equilibria
inferred← citeshttps://doi.org/10.1016/j.cam.2026.117529openalex-snapshot
A generalized multi-parameterized proximal point algorithm for linearly constrained convex optimization problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.12.006openalex-snapshot
A survey on the continuous nonlinear resource allocation problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.06.005openalex-snapshot
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
inferred← citeshttps://doi.org/10.1016/s0167-8191(05)80072-9openalex-snapshot
Synchronous and asynchronous implementations of relaxation algorithms for nonlinear network optimization
inferred← citeshttps://doi.org/10.1016/s0305-0548(97)00056-7openalex-snapshot
Computational comparisons of dual conjugate gradient algorithms for strictly convex networks
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.1016/s1474-6670(17)55135-6openalex-snapshot
Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems
inferred← citeshttps://doi.org/10.1017/cbo9781316162750.004openalex-snapshot
Optimization algorithms for big data with application in wireless networks
inferred← citeshttps://doi.org/10.1017/s0334270000007256openalex-snapshot
Braess's paradox and power-law nonlinearities in networks
inferred← citeshttps://doi.org/10.1023/a:1008667714641openalex-snapshot
A Partitioned ∈-Relaxation Algorithm for Separable Convex Network Flow Problems
inferred← citeshttps://doi.org/10.1023/a:1008778622003openalex-snapshot
Parallel Algorithms for Solving the Convex Minimum Cost Flow Problem
inferred← citeshttps://doi.org/10.1023/a:1008782926733openalex-snapshot
A Primal-Dual Algorithm for Monotropic Programming and its Application to Network Optimization
inferred← citeshttps://doi.org/10.1051/ro:2006003openalex-snapshot
Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
inferred← citeshttps://doi.org/10.1080/02331939308843903openalex-snapshot
A partial linearization method for the traffic assignment problem
inferred← citeshttps://doi.org/10.1080/02331939408843968openalex-snapshot
About saddle values of a class of convex-concave functions
inferred← citeshttps://doi.org/10.1080/10556780601079266openalex-snapshot
A proximal subgradient projection algorithm for linearly constrained strictly convex problems
inferred← citeshttps://doi.org/10.1080/10637199508915508openalex-snapshot
PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
inferred← citeshttps://doi.org/10.1109/cdc.2010.5717911openalex-snapshot
Auction algorithm for Nonlinear Resource Allocation 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/cdc.2013.6760234openalex-snapshot
Forward and reverse auction algorithms for Nonlinear Resource Allocation
inferred← citeshttps://doi.org/10.1109/cdc.2015.7402503openalex-snapshot
Distributed frequency control of inertia-less AC microgrids
inferred← citeshttps://doi.org/10.1109/cdc.2016.7798521openalex-snapshot
Distributed balancing in digraphs under interval constraints
inferred← citeshttps://doi.org/10.1109/cdc.2017.8263799openalex-snapshot
Distributed balancing under interval flow constraints in directed communication topologies
inferred← citeshttps://doi.org/10.1109/icassp.2014.6853716openalex-snapshot
Max-min network flow and resource allocation for backhaul constrained heterogeneous wireless networks
inferred← citeshttps://doi.org/10.1109/icassp.2015.7178500openalex-snapshot
Semi-asynchronous routing for large scale hierarchical networks
inferred← citeshttps://doi.org/10.1109/icassp.2017.7952621openalex-snapshot
A nonconvex splitting method for symmetric nonnegative matrix factorization: Convergence analysis and optimality
inferred← citeshttps://doi.org/10.1109/icuas.2017.7991447openalex-snapshot
Decentralized hungarian-based approach for fast and scalable task allocation
inferred← citeshttps://doi.org/10.1109/ipdpsw.2015.34openalex-snapshot
Parallel Asynchronous Modified Newton Methods for Network Flows
inferred← citeshttps://doi.org/10.1109/jsac.2014.2328171openalex-snapshot
Min Flow Rate Maximization for Software Defined Radio Access Networks
inferred← citeshttps://doi.org/10.1109/msp.2015.2481563openalex-snapshot
A Unified Algorithmic Framework for Block-Structured Optimization Involving Big Data: With applications in machine learning and signal processing
inferred← citeshttps://doi.org/10.1109/naecon46414.2019.9057847openalex-snapshot
Cluster-Based Hungarian Approach to Task Allocation for Unmanned Aerial Vehicles
inferred← citeshttps://doi.org/10.1109/tac.2018.2829465openalex-snapshot
Distributed Balancing of Commodity Networks Under Flow Interval Constraints
inferred← citeshttps://doi.org/10.1109/tac.2020.3036288openalex-snapshot
Distributed Balancing Under Flow Constraints Over Arbitrary Communication Topologies
inferred← citeshttps://doi.org/10.1109/tro.2023.3335656openalex-snapshot
Distributed Matching-By-Clone Hungarian-Based Algorithm for Task Allocation of Multiagent Systems
inferred← citeshttps://doi.org/10.1109/tsipn.2017.2721298openalex-snapshot
A Distributed Semiasynchronous Algorithm for Network Traffic Engineering
inferred← citeshttps://doi.org/10.1109/tsp.2017.2679687openalex-snapshot
A Nonconvex Splitting Method for Symmetric Nonnegative Matrix Factorization: Convergence Analysis and Optimality
inferred← citeshttps://doi.org/10.1137/0325006openalex-snapshot
Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
inferred← citeshttps://doi.org/10.1137/0328011openalex-snapshot
Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
inferred← citeshttps://doi.org/10.1137/0328040openalex-snapshot
Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems
inferred← citeshttps://doi.org/10.1137/0329057openalex-snapshot
On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1137/0801024openalex-snapshot
Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems
inferred← citeshttps://doi.org/10.1137/s1052623494265359openalex-snapshot
Applying a Newton Method to Strictly Convex Separable Network Quadratic Programs
inferred← citeshttps://doi.org/10.1137/s1052623495285886openalex-snapshot
An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems
inferred← citeshttps://doi.org/10.1145/3337821.3337861openalex-snapshot
Adaptive Routing Reconfigurations to Minimize Flow Cost in SDN-Based Data Center Networks
inferred← citeshttps://doi.org/10.1145/55364.55428openalex-snapshot
The connection machines CM-1 and CM-2: solving nonlinear network problems
inferred← citeshttps://doi.org/10.1287/mnsc.41.10.1654openalex-snapshot
Forest Management: A Multicommodity Flow Formulation and Sensitivity Analysis
inferred← citeshttps://doi.org/10.1287/mnsc.46.1.126.15132openalex-snapshot
A Survey of Algorithms for Convex Multicommodity Flow Problems
inferred← citeshttps://doi.org/10.1287/moor.16.3.462openalex-snapshot
Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
inferred← citeshttps://doi.org/10.1287/moor.18.4.846openalex-snapshot
On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
inferred← citeshttps://doi.org/10.1287/moor.22.2.326openalex-snapshot
Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
inferred← citeshttps://doi.org/10.1287/moor.26.2.221.10557openalex-snapshot
An ϵ-Out-of-Kilter Method for Monotropic Programming
inferred← citeshttps://doi.org/10.1287/opre.36.1.93openalex-snapshot
Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
inferred← citeshttps://doi.org/10.1561/2600000016openalex-snapshot
Distributed Averaging and Balancing in Network Systems
inferred← citeshttps://doi.org/10.15807/jorsj.34.263openalex-snapshot
DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
inferred← citeshttps://doi.org/10.21236/ada148027openalex-snapshot
Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
inferred← citeshttps://doi.org/10.23919/ecc.2018.8550388openalex-snapshot
On the Use of Entropy-Like Functions for Solving the Network Flow Problem with Application to Electric Power Systems
inferred← citeshttps://doi.org/10.2514/6.2020-0658openalex-snapshot
Distributed Recursive Hungarian-based Approaches to Fast Task Allocation for Unmanned Aircraft Systems
inferred← citeshttps://doi.org/10.31274/etd-180810-1096openalex-snapshot
Policy driven capacity expansion planning of energy infrastructure: modeling and solutions using high performance computing
inferred← citeshttps://doi.org/10.3390/appliedmath6060090openalex-snapshot
Mathematical Social Dynamics: Traditional and New Areas of Research
inferred← citeshttps://doi.org/10.3390/e24101485openalex-snapshot
Flows of Substances in Networks and Network Channels: Selected Results and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.2107.10350openalex-snapshot
Uncertainty-Aware Task Allocation for Distributed Autonomous Robots
inferred← citeshttps://doi.org/10.70675/6dc43fe2zff40z4765zb97bz8bc6d860acc1openalex-snapshot
Optimisation des flux dans les réseaux de transport pour les systèmes dynamiques étendus : cas des systèmes hydrographiques
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.