On the public citation graph

Diagnosing infeasibilities in network flow problems

https://doi.org/10.1007/bf01580084
0 signed · 26 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/978-0-8176-4842-8_17openalex-snapshot
A Theorem on Flows in Networks
inferredcites →https://doi.org/10.1007/bf01415937openalex-snapshot
Implementing Goldberg's max-flow-algorithm ? A computational investigation
inferredcites →https://doi.org/10.1007/bf01580850openalex-snapshot
An efficient algorithm for the minimum capacity cut problem
inferredcites →https://doi.org/10.1016/0022-0000(82)90032-0openalex-snapshot
Space complexity in on-line computation
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1016/0377-2217(81)90177-6openalex-snapshot
Irreducibly inconsistent systems of linear inequalities
inferredcites →https://doi.org/10.1093/imaman/2.1.39openalex-snapshot
Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility
inferredcites →https://doi.org/10.1137/0218003openalex-snapshot
A Fast Parametric Maximum Flow Algorithm and Applications
inferredcites →https://doi.org/10.1137/0218072openalex-snapshot
Analysis of Preflow Push Algorithms for Maximum Network Flow
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1287/ijoc.3.2.157openalex-snapshot
Locating Minimal Infeasible Constraint Sets in Linear Programs
inferredcites →https://doi.org/10.1287/inte.23.6.120openalex-snapshot
How to Analyze the Results of Linear Programs—Part 3: Infeasibility Diagnosis
inferredcites →https://doi.org/10.2140/pjm.1957.7.1073openalex-snapshot
A theorem on flows in networks
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.

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.21686openalex-snapshot
A characterization of irreducible infeasible subsystems in flow networks
inferred← citeshttps://doi.org/10.1007/3-540-48777-8_4openalex-snapshot
Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem
inferred← citeshttps://doi.org/10.1007/bf02614370openalex-snapshot
How to compute least infeasible flows
inferred← citeshttps://doi.org/10.1007/s10107-002-0363-5openalex-snapshot
On the maximum feasible subsystem problem, IISs and IIS-hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.01.061openalex-snapshot
A study on modularity density maximization: Column generation acceleration and computational complexity analysis
inferred← citeshttps://doi.org/10.1145/2806416.2806555openalex-snapshot
What Is a Network Community?
inferred← citeshttps://doi.org/10.1364/jocn.8.000118openalex-snapshot
Quality of Service Provisioning and Energy Minimized Scheduling in Software Defined Flexible Optical Networks
inferred← citeshttps://doi.org/10.14279/depositonce-543openalex-snapshot
The maximum feasible subsystem problem and vertex-facet incidences of polyhedra
inferred← citeshttps://doi.org/10.2514/1.51870openalex-snapshot
Matrix Methods for Optimal Manifesting of Multinode Space Exploration Systems
inferred← citeshttps://doi.org/10.2514/6.2010-8805openalex-snapshot
Matrix Methods for Optimal Manifesting of Multi-Node Space Exploration Systems
inferred← citeshttps://doi.org/10.33915/etd.3843openalex-snapshot
Analyzing Satisfiability and Refutability in Selected Constraint Systems
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.