On the public citation graph
A note onK best network flows
0 signed · 42 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/net.3230100202openalex-snapshot
The k best spanning arborescences of a network
inferredcites →https://doi.org/10.1007/978-1-4419-7729-8openalex-snapshot
Stochastic Linear Programming
inferredcites →https://doi.org/10.1007/978-3-642-66252-2openalex-snapshot
Stochastic Linear Programming
inferredcites →https://doi.org/10.1007/978-94-010-0646-0openalex-snapshot
Fuzzy Set Theory—and Its Applications
inferredcites →https://doi.org/10.1007/bf01582247openalex-snapshot
Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems
inferredcites →https://doi.org/10.1007/bf01919086openalex-snapshot
A new exchange property for matroids and its application to max-min-problems
inferredcites →https://doi.org/10.1007/bf02022039openalex-snapshot
K best solutions to combinatorial optimization problems
inferredcites →https://doi.org/10.1007/bfb0120919openalex-snapshot
Minimal cost flows in regular matroids
inferredcites →https://doi.org/10.1016/0166-218x(86)90053-3openalex-snapshot
Duality for balanced submodular flows
inferredcites →https://doi.org/10.1016/0166-218x(87)90017-5openalex-snapshot
Algorithms for finding K-best perfect matchings
inferredcites →https://doi.org/10.1016/0166-218x(93)90043-nopenalex-snapshot
Note on combinatorial optimization with max-linear objective functions
inferredcites →https://doi.org/10.1016/0167-6377(84)90083-xopenalex-snapshot
On finding the K best cuts in a network
inferredcites →https://doi.org/10.1016/0377-2217(89)90384-6openalex-snapshot
k-optimal solution sets for some polynomially solvable scheduling problems
inferredcites →https://doi.org/10.1016/s0304-0208(08)72962-1openalex-snapshot
Ranking the Cuts and Cut-Sets of a Network
inferredcites →https://doi.org/10.1057/jors.1981.67openalex-snapshot
Discrete Structures and Algorithms
inferredcites →https://doi.org/10.1057/jors.1983.216openalex-snapshot
Multiple Criteria Decision Making
inferredcites →https://doi.org/10.1080/07408178408974693openalex-snapshot
On Optimizing Bin Picking and Insertion Plans for Assembly Robots
inferredcites →https://doi.org/10.1137/0206011openalex-snapshot
Two Algorithms for Generating Weighted Spanning Trees in Order
inferredcites →https://doi.org/10.1137/0402002openalex-snapshot
Intersection of Two Matroids: (Condensed) Border Graphs and Ranking
inferredcites →https://doi.org/10.1287/mnsc.18.7.401openalex-snapshot
A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
inferredcites →https://doi.org/10.1287/opre.16.3.682openalex-snapshot
Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
inferredcites →https://doi.org/10.2307/1423177openalex-snapshot
Fuzzy Set Theory and Its Applications
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.1007/0-306-48107-3_8openalex-snapshot
Multiobjective Combinatorial Optimization — Theory, Methodology, and Applications
inferred← citeshttps://doi.org/10.1007/s00224-025-10240-zopenalex-snapshot
On Strings Having the Same Length-k Substrings
inferred← citeshttps://doi.org/10.1007/s10479-006-0073-0openalex-snapshot
A decision-theoretic approach to robust optimization in multivalued graphs
inferred← citeshttps://doi.org/10.1007/s10878-025-01376-2openalex-snapshot
Output-sensitive complexity of multi-objective integer network flow problems
inferred← citeshttps://doi.org/10.1016/j.cie.2008.12.005openalex-snapshot
Preemptive priority-based algorithms for fuzzy minimal cost flow problem: An application in hazardous materials transportation
inferred← citeshttps://doi.org/10.1016/j.cirp.2010.03.124openalex-snapshot
Implications of k-best modular product design solutions to global manufacturing
inferred← citeshttps://doi.org/10.1016/j.cor.2008.06.008openalex-snapshot
A two-phase algorithm for the biobjective integer minimum cost flow problem
inferred← citeshttps://doi.org/10.1016/j.cor.2012.08.014openalex-snapshot
On the K best integer network flows
inferred← citeshttps://doi.org/10.1016/j.cor.2014.03.016openalex-snapshot
An efficient procedure for finding best compromise solutions to the multi-objective assignment problem
inferred← citeshttps://doi.org/10.1016/j.cor.2025.107254openalex-snapshot
Grouping strategies on two-phase methods for bi-objective combinatorial optimization
inferred← citeshttps://doi.org/10.1016/j.dam.2022.07.007openalex-snapshot
Finding all minimum cost flows and a faster algorithm for the K best flow problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.09.033openalex-snapshot
Multiple objective minimum cost flow problems: A review
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.10.031openalex-snapshot
On the computation of all supported efficient solutions in multi-objective integer network flow problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2009.06.017openalex-snapshot
On the K shortest path trees problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2009.10.015openalex-snapshot
Choquet-based optimisation in multiobjective shortest path and spanning tree problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.01.021openalex-snapshot
A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
inferred← citeshttps://doi.org/10.1016/j.omega.2017.06.009openalex-snapshot
Exploring K-best solutions to enrich network design decision-making
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00353-3openalex-snapshot
Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach
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.