On the public citation graph

A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series—parallel networks

0 signed · 49 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.
Claim with ORCID
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.
See reference health

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/bf01580862openalex-snapshot
Some proximity and sensitivity results in quadratic integer programming
inferredcites →https://doi.org/10.1007/bf01585739openalex-snapshot
Algebraic optimization: The Fermat-Weber location problem
inferredcites →https://doi.org/10.1007/bf01585740openalex-snapshot
Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm
inferredcites →https://doi.org/10.1007/bf02579369openalex-snapshot
A strongly polynomial minimum cost circulation algorithm
inferredcites →https://doi.org/10.1007/bfb0121104openalex-snapshot
Solving integer minimum cost flows with separable convex cost objective polynomially
inferredcites →https://doi.org/10.1016/0041-5553(80)90098-1openalex-snapshot
The polynomial solvability of convex quadratic programming
inferredcites →https://doi.org/10.1016/0166-218x(85)90006-xopenalex-snapshot
Minimum cost flow algorithms for series-parallel networks
inferredcites →https://doi.org/10.1016/0167-6377(87)90036-8openalex-snapshot
Strongly polynomial algorithm for a class of combinatorial LCPs
inferredcites →https://doi.org/10.1016/0377-2217(84)90160-7openalex-snapshot
A polynomial algorithm for minimum quadratic cost flow problems
inferredcites →https://doi.org/10.1057/jors.1989.116openalex-snapshot
Resource Allocation Problems: Algorithmic Approaches
inferredcites →https://doi.org/10.1137/0211023openalex-snapshot
The Recognition of Series Parallel Digraphs
inferredcites →https://doi.org/10.1137/0220020openalex-snapshot
Lower Bounds for Computations with the Floor Operation
inferredcites →https://doi.org/10.1137/0404048openalex-snapshot
Obnoxious Facility Location on Graphs
inferredcites →https://doi.org/10.1145/96559.96597openalex-snapshot
Convex separable optimization is not much harder than linear optimization
inferredcites →https://doi.org/10.1287/opre.23.2.360openalex-snapshot
Technical Note—Allocation of Effort Resources among Competing Activities

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.21740openalex-snapshot
Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_44openalex-snapshot
Resource Allocation Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_14openalex-snapshot
Resource Allocation Problems
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_44-1openalex-snapshot
Resource Allocation Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-04651-4_10openalex-snapshot
Generating Algebraic Expressions for Labeled Grid Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_21openalex-snapshot
On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-14974-5_19openalex-snapshot
Algebraic Expressions of Rhomboidal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-39574-6_19openalex-snapshot
Scheduling with Maintenance and Linear Cumulative Effects
inferred← citeshttps://doi.org/10.1007/978-3-319-39574-6_4openalex-snapshot
Relevant Boolean Programming Problems
inferred← citeshttps://doi.org/10.1007/bf01585561openalex-snapshot
About strongly polynomial time algorithms for quadratic optimization over submodular constraints
inferred← citeshttps://doi.org/10.1007/bf02522821openalex-snapshot
Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
inferred← citeshttps://doi.org/10.1007/s10107-018-1234-zopenalex-snapshot
Scaling, proximity, and optimization of integrally convex functions
inferred← citeshttps://doi.org/10.1007/s10288-011-0180-xopenalex-snapshot
The symmetric quadratic knapsack problem: approximation and scheduling applications
inferred← citeshttps://doi.org/10.1007/s10479-007-0172-6openalex-snapshot
Complexity and algorithms for nonlinear optimization problems
inferred← citeshttps://doi.org/10.1007/s10479-015-2018-yopenalex-snapshot
Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
inferred← citeshttps://doi.org/10.1007/s10589-022-00434-3openalex-snapshot
Avoiding bad steps in Frank-Wolfe variants
inferred← citeshttps://doi.org/10.1007/s10951-016-0497-6openalex-snapshot
Single machine scheduling with a generalized job-dependent cumulative effect
inferred← citeshttps://doi.org/10.1016/j.dam.2016.01.011openalex-snapshot
Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2022.04.015openalex-snapshot
On lengths of edge-labeled graph expressions
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.12.028openalex-snapshot
Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product
inferred← citeshttps://doi.org/10.1016/j.endm.2015.05.036openalex-snapshot
A Note on Algebraic Expressions of Rhomboidal Labeled Graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2017.06.006openalex-snapshot
On Algebraic Expressions of Directed Grid Graphs
inferred← citeshttps://doi.org/10.1016/j.omega.2018.11.001openalex-snapshot
A fast FPTAS for single machine scheduling problem of minimizing total weighted earliness and tardiness about a large common due date
inferred← citeshttps://doi.org/10.1109/tmc.2012.88openalex-snapshot
Deployment of a Connected Reinforced Backbone Network with a Limited Number of Backbone Nodes
inferred← citeshttps://doi.org/10.1137/080736156openalex-snapshot
M-Convex Function Minimization by Continuous Relaxation Approach: Proximity Theorem and Algorithm
inferred← citeshttps://doi.org/10.1137/140978296openalex-snapshot
A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives
inferred← citeshttps://doi.org/10.1142/s0129054110007301openalex-snapshot
MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK
inferred← citeshttps://doi.org/10.1145/2213977.2213981openalex-snapshot
Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
inferred← citeshttps://doi.org/10.1287/ijoc.2021.1104openalex-snapshot
On a Reduction for a Class of Resource Allocation Problems
inferred← citeshttps://doi.org/10.1287/ijoo.2021.0065openalex-snapshot
A Class of Convex Quadratic Nonseparable Resource Allocation Problems with Generalized Bound Constraints
inferred← citeshttps://doi.org/10.1287/moor.19.1.94openalex-snapshot
Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
inferred← citeshttps://doi.org/10.3990/1.9789036551618openalex-snapshot
Duality-driven optimization in energy management: offline and online algorithms for resource allocation problems
inferred← citeshttps://doi.org/10.48550/arxiv.cond-mat/9707023openalex-snapshot
Asymptotic behavior of two-terminal series-parallel networks
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.