On the public citation graph
Multipoint methods for separable nonlinear networks
0 signed · 47 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/bf02591890openalex-snapshot
Computational aspects of two-segment separable programming
inferredcites →https://doi.org/10.1007/bfb0120926openalex-snapshot
Secant approximation methods for convex optimization
inferredcites →https://doi.org/10.1016/0305-0548(93)90042-hopenalex-snapshot
Nonlinear programming: theory and algorithms
inferredcites →https://doi.org/10.1057/jors.1979.231openalex-snapshot
Nonlinear Programming -- Theory and Algorithms
inferredcites →https://doi.org/10.1080/00401706.1971.10488871openalex-snapshot
Integer and Nonlinear Programming
inferredcites →https://doi.org/10.1109/tac.1976.1101194openalex-snapshot
On the Goldstein-Levitin-Polyak gradient projection method
inferredcites →https://doi.org/10.1137/0134059openalex-snapshot
Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
inferredcites →https://doi.org/10.1145/356022.356025openalex-snapshot
A Reduced Gradient Algorithm for Nonlinear Network Problems
inferredcites →https://doi.org/10.1287/mnsc.24.7.747openalex-snapshot
Solving the Pipe Network Analysis Problem Using Optimization Techniques
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nav.3800380609openalex-snapshot
Sandwich approximation of univariate convex functions with an application to separable convex programming
inferred← citeshttps://doi.org/10.1002/net.22135openalex-snapshot
Mean‐standard deviation model for minimum cost flow problem
inferred← citeshttps://doi.org/10.1002/net.3230190108openalex-snapshot
Implementing an “exact” Newton method for separable convex transportation problems
inferred← citeshttps://doi.org/10.1002/net.3230210407openalex-snapshot
Computational development of a lagrangian dual approach for quadratic networks
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-1-4757-6075-0_4openalex-snapshot
Transportation-Oriented Optimization
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/bf00248762openalex-snapshot
Application of the dual active set algorithm to quadratic network optimization
inferred← citeshttps://doi.org/10.1007/bf01585748openalex-snapshot
An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds
inferred← citeshttps://doi.org/10.1007/bf02680549openalex-snapshot
A variable-penalty alternating directions method for convex optimization
inferred← citeshttps://doi.org/10.1007/s10107-005-0595-2openalex-snapshot
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
inferred← citeshttps://doi.org/10.1007/s10589-018-9987-0openalex-snapshot
Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training
inferred← citeshttps://doi.org/10.1007/s10589-023-00488-xopenalex-snapshot
An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
inferred← citeshttps://doi.org/10.1007/s10957-008-9489-9openalex-snapshot
Decomposition Algorithm Model for Singly Linearly-Constrained Problems Subject to Lower and Upper Bounds
inferred← citeshttps://doi.org/10.1016/0377-2217(86)90061-5openalex-snapshot
Estimating joint strata weights for poststratification
inferred← citeshttps://doi.org/10.1016/0377-2217(86)90300-0openalex-snapshot
Performance evaluation of independent superbasic sets on nonlinear replicated networks
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/s0305-0548(97)00056-7openalex-snapshot
Computational comparisons of dual conjugate gradient algorithms for strictly convex 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.1080/01966324.1992.10737340openalex-snapshot
Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems
inferred← citeshttps://doi.org/10.1109/59.496179openalex-snapshot
A hybrid decoupled approach to optimal power flow
inferred← citeshttps://doi.org/10.1109/icics.2003.1292661openalex-snapshot
Minimum convex cost flow problem
inferred← citeshttps://doi.org/10.1137/0804045openalex-snapshot
Coordination in Coarse-Grained Decomposition
inferred← citeshttps://doi.org/10.1137/17m1128538openalex-snapshot
A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables
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/s0217595910002594openalex-snapshot
IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS
inferred← citeshttps://doi.org/10.1145/3388831.3388855openalex-snapshot
Deployment Planning in Vehicular Supported Cellular Networks
inferred← citeshttps://doi.org/10.1287/ijoc.12.4.324.11877openalex-snapshot
Practical Piecewise-Linear Approximation for Monotropic Optimization
inferred← citeshttps://doi.org/10.1287/mnsc.34.3.411openalex-snapshot
Piecewise-Linear Approximation Methods for Nonseparable Convex Optimization
inferred← citeshttps://doi.org/10.1287/opre.37.3.353openalex-snapshot
OR Practice—Large-Scale Nonlinear Network Models and Their Application
inferred← citeshttps://doi.org/10.1590/s0103-65131996000200001openalex-snapshot
Programação linear por partes: revisão teórica e aplicações
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.32890/jict2004.3.1.3openalex-snapshot
On Network Flow Problems with Convex Cost
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.