On the public citation graph
Examples of max-flow and min-cut problems with duality gaps in continuous networks
0 signed · 25 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-1-4684-9486-0openalex-snapshot
Minimal Surfaces and Functions of Bounded Variation
inferredcites →https://doi.org/10.1007/bf01448377openalex-snapshot
Dual spaces of stresses and strains, with applications to Hencky plasticity
inferredcites →https://doi.org/10.1007/bf02571255openalex-snapshot
A measure-theoretical max-flow-min-cut problem
inferredcites →https://doi.org/10.1007/bfb0087685openalex-snapshot
Convex Analysis and Measurable Multifunctions
inferredcites →https://doi.org/10.1007/bfb0121231openalex-snapshot
Continuum approximation to dense networks and its application to the analysis of urban road networks
inferredcites →https://doi.org/10.1016/0016-0032(39)90673-3openalex-snapshot
Elements of the topology of plane sets of points
inferredcites →https://doi.org/10.1016/0377-2217(88)90019-7openalex-snapshot
Linear programming in infinite-dimensional spaces
inferredcites →https://doi.org/10.1016/s0076-5392(08)x6005-9openalex-snapshot
Network Flow, Transportation and Scheduling - Theory and Algorithms
inferredcites →https://doi.org/10.1057/jors.1970.122openalex-snapshot
Integer Programming and Network Flows.
inferredcites →https://doi.org/10.1057/jors.1989.13openalex-snapshot
Linear Programming in Infinite-Dimensional Spaces
inferredcites →https://doi.org/10.18910/7180openalex-snapshot
Max-flow min-cut theorem in an anisotropic network
inferredcites →https://doi.org/10.2307/3008450openalex-snapshot
Integer Programming and Network Flows.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nme.6792openalex-snapshot
A fast Fourier transform based method for computing the effective crack energy of a heterogeneous material on a combinatorially consistent grid
inferred← citeshttps://doi.org/10.1007/0-387-71215-1openalex-snapshot
Time-Varying Network Optimization
inferred← citeshttps://doi.org/10.1007/978-0-387-34897-1_3openalex-snapshot
Network flow — Theory and applications with practical impact
inferred← citeshttps://doi.org/10.1007/978-0-387-75714-8_1openalex-snapshot
Maximum Flows and Minimum Cuts in the Plane
inferred← citeshttps://doi.org/10.1007/978-1-4757-3333-4_12openalex-snapshot
Non-Static Network Optimization Problems: A Survey
inferred← citeshttps://doi.org/10.1007/s00211-013-0569-xopenalex-snapshot
A spatially continuous max-flow and min-cut framework for binary labeling problems
inferred← citeshttps://doi.org/10.1007/s002459900113openalex-snapshot
A Relaxation of a Min-Cut Problem in an Anisotropic Continuous Network
inferred← citeshttps://doi.org/10.1007/s10898-009-9471-6openalex-snapshot
Maximum flows and minimum cuts in the plane
inferred← citeshttps://doi.org/10.1137/100799186openalex-snapshot
Combinatorial Continuous Maximum Flow
inferred← citeshttps://doi.org/10.1201/b12281-5openalex-snapshot
Targeted Image Segmentation Using Graph Methods
inferred← citeshttps://doi.org/10.5445/ir/1000136993openalex-snapshot
A fast Fourier transform based method for computing the effective crack energy of a heterogeneous material on a combinatorially consistent grid
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.