On the public citation graph
Inverse Generalized Maximum Flow Problems
0 signed · 35 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/9781119005353.ch17openalex-snapshot
An Introduction to Inverse Combinatorial Problems
inferredcites →https://doi.org/10.1002/net.10048openalex-snapshot
Combinatorial algorithms for inverse network flow problems
inferredcites →https://doi.org/10.1002/net.21862openalex-snapshot
Inverse optimization in minimum cost flow problems on countably infinite networks
inferredcites →https://doi.org/10.1007/3-540-69346-7_24openalex-snapshot
Simple Generalized Maximum Flow Algorithms
inferredcites →https://doi.org/10.1007/s10878-006-9006-8openalex-snapshot
Inverse maximum flow problems under the weighted Hamming distance
inferredcites →https://doi.org/10.1007/s11590-015-0919-yopenalex-snapshot
Capacity inverse minimum cost flow problems under the weighted Hamming distance
inferredcites →https://doi.org/10.1007/s40305-018-0231-5openalex-snapshot
Inverse Generalized Minimum Cost Flow Problem Under the Hamming Distances
inferredcites →https://doi.org/10.1016/j.dam.2015.12.017openalex-snapshot
On inverse linear programming problems under the bottleneck-type weighted Hamming distance
inferredcites →https://doi.org/10.1016/j.dam.2017.06.002openalex-snapshot
Inverse minimum flow problem under the weighted sum-type Hamming distance
inferredcites →https://doi.org/10.1023/b:joco.0000038914.26975.9bopenalex-snapshot
Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results
inferredcites →https://doi.org/10.1051/ro/2017088openalex-snapshot
Reverse maximum flow problem under the weighted Chebyshev distance
inferredcites →https://doi.org/10.1051/ro:2008017openalex-snapshot
The inverse maximum flow problem consideringl∞norm
inferredcites →https://doi.org/10.1080/02331939708844306openalex-snapshot
Inverse maximum flow and minimum cut problems
inferredcites →https://doi.org/10.1109/tct.1966.1082612openalex-snapshot
Dynamic Programming of Optimum Flows in Lossy Communication Nets
inferredcites →https://doi.org/10.1137/0132037openalex-snapshot
On Max Flows with Gains and Pure Min-Cost Flows
inferredcites →https://doi.org/10.1145/3055399.3055439openalex-snapshot
A simpler and faster strongly polynomial algorithm for generalized flow maximization
inferredcites →https://doi.org/10.1287/moor.2016.0800openalex-snapshot
A Strongly Polynomial Algorithm for Generalized Flow Maximization
inferredcites →https://doi.org/10.1287/opre.10.4.476openalex-snapshot
New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
inferredcites →https://doi.org/10.2298/yjor0801013dopenalex-snapshot
The inverse maximum flow problem with lower and upper bounds for the flow
inferredcites →https://doi.org/10.2298/yjor150624009topenalex-snapshot
Efficient algorithms for the reverse shortest path problem on trees under the hamming distance
inferredcites →https://doi.org/10.2307/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.
inferredcites →https://doi.org/10.31926/but.mif.2019.12.61.1.10openalex-snapshot
Inverse maximum flow problem in planar networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11590-024-02183-0openalex-snapshot
Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and $$\ell _\infty$$-norm objectives
inferred← citeshttps://doi.org/10.1109/ispdc59212.2023.00012openalex-snapshot
Finding minimum loss path in big networks
inferred← citeshttps://doi.org/10.3390/axioms13020127openalex-snapshot
Widest Path in Networks with Gains/Losses
inferred← citeshttps://doi.org/10.3390/computation13020040openalex-snapshot
Novel GPU-Based Method for the Generalized Maximum Flow Problem
inferred← citeshttps://doi.org/10.3390/drones9100677openalex-snapshot
Advances in Cartography, Mission Planning, Path Search, and Path Following for Drones
inferred← citeshttps://doi.org/10.3390/math8091494openalex-snapshot
Inverse Minimum Cut Problem with Lower and Upper Bounds
inferred← citeshttps://doi.org/10.3390/math9151716openalex-snapshot
Adaptation of Random Binomial Graphs for Testing Network Flow Problems Algorithms
inferred← citeshttps://doi.org/10.3390/math9182308openalex-snapshot
Flow Increment through Network Expansion
inferred← citeshttps://doi.org/10.3934/math.2021237openalex-snapshot
Expanding maximum capacity path under weighted sum-type distances
inferred← citeshttps://doi.org/10.59395/ijadis.v6i2.1381openalex-snapshot
Customer Transaction Clustering with K-Prototype Algorithm Using Euclidean-Hamming Distance and Elbow Method
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.