On the public citation graph
Proximal decomposition for multicommodity flow problems with convex costs
0 signed · 43 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.3230030202openalex-snapshot
The flow deviation method: An approach to store‐and‐forward communication network design
inferredcites →https://doi.org/10.1007/bf01585162openalex-snapshot
Multicommodity network flows: The impact of formulation on decomposition
inferredcites →https://doi.org/10.1007/bf01586091openalex-snapshot
Applications of the method of partial inverses to convex programming: Decomposition
inferredcites →https://doi.org/10.1007/bf02997589openalex-snapshot
Multiflots de coût minimal avec fonctions de coût concaves
inferredcites →https://doi.org/10.1007/bf02999753openalex-snapshot
Synthèse optimale d’un réseau de télécommunication avec contraintes de sécurité
inferredcites →https://doi.org/10.1051/ro/197509v300211openalex-snapshot
Résolution des problèmes de multiflots en nombres entiers dans les grands réseaux
inferredcites →https://doi.org/10.1109/tac.1983.1103183openalex-snapshot
Projected Newton methods and optimization of multicommodity flows
inferredcites →https://doi.org/10.1109/tcom.1977.1093711openalex-snapshot
A Minimum Delay Routing Algorithm Using Distributed Computation
inferredcites →https://doi.org/10.1109/tcom.1977.1093750openalex-snapshot
A Class of Decentralized Routing Algorithms Using Relaxation
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/0325067openalex-snapshot
Relaxation Methods for Network Flow Problems with Convex Arc Costs
inferredcites →https://doi.org/10.1137/0805023openalex-snapshot
Proximal Decomposition on the Graph of a Maximal Monotone Operator
inferredcites →https://doi.org/10.1287/ijoc.4.2.192openalex-snapshot
Using a Hop-Constrained Model to Generate Alternative Communication Network Design
inferredcites →https://doi.org/10.1287/opre.26.2.209openalex-snapshot
A Survey of Linear Cost Multicommodity Network Flows
inferredcites →https://doi.org/10.14989/doctor.k3988openalex-snapshot
Studies on Multicommodity Flows in Directed Networks
inferredcites →https://doi.org/10.15807/jorsj.27.151openalex-snapshot
A NONSMOOTH OPTIMIZATION APPROACH TO NONLINEAR MULTICOMMODITY NETWORK FLOW PROBLEMS
inferredcites →https://doi.org/10.2307/2004303openalex-snapshot
Communication Nets: Stochastic Message Flow and Delay
inferredcites →https://doi.org/10.24033/bsmf.1625openalex-snapshot
Proximité et dualité dans un espace hilbertien
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118600283.ch9openalex-snapshot
Network Design Problems: Fundamental Methods
inferred← citeshttps://doi.org/10.1002/9781119005384.ch9openalex-snapshot
Network Design Problems: Fundamental Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-32216-8_29openalex-snapshot
An Adaptive Threshold Algorithm for Offline Uyghur Handwritten Text Line Segmentation
inferred← citeshttps://doi.org/10.1007/978-3-031-18530-4_2openalex-snapshot
Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints
inferred← citeshttps://doi.org/10.1007/978-981-13-6834-9_4openalex-snapshot
Improved Lightweight RFID Bidirectional Authentication Protocol LMAP++
inferred← citeshttps://doi.org/10.1007/s41650-018-0022-5openalex-snapshot
Critical Analysis of DDoS—An Emerging Security Threat over IoT Networks
inferred← citeshttps://doi.org/10.1016/b978-155860608-1/50005-3openalex-snapshot
Internet Traffic Engineering
inferred← citeshttps://doi.org/10.1016/j.dam.2024.06.033openalex-snapshot
A project and lift approach for a 2-commodity flow relocation model in a time expanded network
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.08.014openalex-snapshot
Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
inferred← citeshttps://doi.org/10.1023/a:1015546212618openalex-snapshot
Planning Models for Wide-Area Communication Network Design with Response-Time-Dependent Offered Traffic
inferred← citeshttps://doi.org/10.1080/02331934.2015.1062009openalex-snapshot
A proximal multiplier method for separable convex minimization
inferred← citeshttps://doi.org/10.1080/02331934.2016.1261138openalex-snapshot
Convergence rate of a proximal multiplier algorithm for separable convex minimization
inferred← citeshttps://doi.org/10.1109/icccn.1999.805577openalex-snapshot
Explicit routing algorithms for Internet traffic engineering
inferred← citeshttps://doi.org/10.1109/tnet.2022.3192167openalex-snapshot
MiFi: Bounded Update to Optimize Network Performance in Software-Defined Data Centers
inferred← citeshttps://doi.org/10.1109/wmnc.2011.6097256openalex-snapshot
An ant colony optimization metaheuristic for solving bi-objective multi-sources multicommodity communication flow problem
inferred← citeshttps://doi.org/10.1186/s13638-020-01837-8openalex-snapshot
Double sink energy hole avoidance strategy for wireless sensor network
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.25.3.409.12214openalex-snapshot
Asymptotic Analysis of Congested Communication Networks
inferred← citeshttps://doi.org/10.1287/trsc.2019.0955openalex-snapshot
On the Existence of System-Optimum–Inducing Tolling Functions for Transportation Networks
inferred← citeshttps://doi.org/10.15381/pes.v14i2.9590openalex-snapshot
UN MÉTODO MULTIPLICADOR PROXIMAL PARA OPTIMIZACIÓN CONVEXA SEPARABLE
inferred← citeshttps://doi.org/10.1590/s0101-74382003000300007openalex-snapshot
Methodes de decomposition et d'agregation pour le traitement de problemes de multiflots
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
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.