On the public citation graph

Structures of polyhedra determined by submodular functions on crossing families

https://doi.org/10.1007/bf02592217
0 signed · 59 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.1002/net.3230120102openalex-snapshot
Minimum cost flow with set‐constraints
inferredcites →https://doi.org/10.1007/3-540-36478-1_2openalex-snapshot
Submodular Functions, Matroids, and Certain Polyhedra
inferredcites →https://doi.org/10.1007/bfb0121196openalex-snapshot
A practical algorithm for the Menger-type generalization of the independent assignment problem
inferredcites →https://doi.org/10.1016/0095-8956(84)90029-7openalex-snapshot
Finding feasible vectors of Edmonds-Giles polyhedra
inferredcites →https://doi.org/10.1016/0166-218x(82)90053-1openalex-snapshot
Minimization on submodular flows
inferredcites →https://doi.org/10.1016/s0167-5060(08)70734-9openalex-snapshot
A Min-Max Relation for Submodular Functions on Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)72446-0openalex-snapshot
An Algorithm for Submodular Functions on Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)72458-7openalex-snapshot
Minimization of Some Nonlinear Functions over Polymatroidal Network Flows
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1287/moor.7.3.334openalex-snapshot
Computing Maximal “Polymatroidal” Network Flows
inferredcites →https://doi.org/10.15807/jorsj.19.32openalex-snapshot
AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
inferredcites →https://doi.org/10.15807/jorsj.20.1openalex-snapshot
A PRIMAL APPROACH TO THE INDEPENDENT ASSIGNMENT PROBLEM
inferredcites →https://doi.org/10.15807/jorsj.20.59openalex-snapshot
AN ALGORITHM FOR FINDING AN OPTIMAL INDEPENDENT LINKAGE
inferredcites →https://doi.org/10.15807/jorsj.21.189openalex-snapshot
ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-45535-3_11openalex-snapshot
Combined Connectivity Augmentation and Orientation Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_6openalex-snapshot
A Survey on Covering Supermodular Functions
inferred← citeshttps://doi.org/10.1007/bf01585712openalex-snapshot
A note on the Frank—Tardos bi-truncation algorithm for crossing-submodular functions
inferred← citeshttps://doi.org/10.1007/bf01589418openalex-snapshot
Generalized polymatroids and submodular flows
inferred← citeshttps://doi.org/10.1007/bf01589419openalex-snapshot
Optimization over the polyhedron determined by a submodular function on a co-intersecting family
inferred← citeshttps://doi.org/10.1007/bf01589420openalex-snapshot
Directed submodularity, ditroids and directed submodular flows
inferred← citeshttps://doi.org/10.1007/bf02592001openalex-snapshot
On the subdifferential of a submodular function
inferred← citeshttps://doi.org/10.1007/bf02614442openalex-snapshot
A capacity scaling algorithm for convex cost submodular flows
inferred← citeshttps://doi.org/10.1007/s004930050047openalex-snapshot
Submodular Flow Problem with a Nonseparable Cost Function
inferred← citeshttps://doi.org/10.1007/s10107-021-01711-5openalex-snapshot
Decreasing minimization on M-convex sets: algorithms and applications
inferred← citeshttps://doi.org/10.1007/s101070100253openalex-snapshot
A faster capacity scaling algorithm for minimum cost submodular flow
inferred← citeshttps://doi.org/10.1007/s13160-012-0084-yopenalex-snapshot
Lattice polyhedra and submodular flows
inferred← citeshttps://doi.org/10.1007/s13160-012-0085-xopenalex-snapshot
Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
inferred← citeshttps://doi.org/10.1016/0166-218x(84)90020-9openalex-snapshot
A vector exchange property of submodular systems
inferred← citeshttps://doi.org/10.1016/0166-218x(86)90022-3openalex-snapshot
Linear and combinatorial sharing problems
inferred← citeshttps://doi.org/10.1016/0166-218x(86)90053-3openalex-snapshot
Duality for balanced submodular flows
inferred← citeshttps://doi.org/10.1016/0166-218x(87)90003-5openalex-snapshot
An out-of-kilter method for submodular flows
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50013-0openalex-snapshot
10.1016/b978-044488002-4/50013-0
inferred← citeshttps://doi.org/10.1016/j.dam.2022.06.015openalex-snapshot
Fair integral submodular flows
inferred← citeshttps://doi.org/10.1016/j.orl.2013.03.009openalex-snapshot
Tree-compositions and orientations
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00229-2openalex-snapshot
Edge splitting and connectivity augmentation in directed hypergraphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(85)80019-4openalex-snapshot
A decomposition of distributive lattices
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00460-2openalex-snapshot
Combined connectivity augmentation and orientation problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00462-6openalex-snapshot
On the orientation of graphs and hypergraphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(05)80010-xopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70131-6openalex-snapshot
References
inferred← citeshttps://doi.org/10.1080/02331938608843101openalex-snapshot
Sharing problems
inferred← citeshttps://doi.org/10.1109/isit.2016.7541752openalex-snapshot
Incremental and decremental secret key agreement
inferred← citeshttps://doi.org/10.1109/jproc.2015.2458316openalex-snapshot
Multivariate Mutual Information Inspired by Secret-Key Agreement
inferred← citeshttps://doi.org/10.1109/tcad.2011.2167328openalex-snapshot
A Realistic Early-Stage Power Grid Verification Algorithm Based on Hierarchical Constraints
inferred← citeshttps://doi.org/10.1109/tit.2017.2749372openalex-snapshot
Change of Multivariate Mutual Information: From Local to Global
inferred← citeshttps://doi.org/10.1109/tit.2017.2761390openalex-snapshot
Determining Optimal Rates for Communication for Omniscience
inferred← citeshttps://doi.org/10.1137/22m1506511openalex-snapshot
On Packing Dijoins in Digraphs and Weighted Digraphs
inferred← citeshttps://doi.org/10.1137/s0895480199361533openalex-snapshot
A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow
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.10.2.251openalex-snapshot
A Primal-Dual Algorithm for Submodular Flows
inferred← citeshttps://doi.org/10.1287/moor.13.1.164openalex-snapshot
The Fair Resource Allocation Problem with Submodular Constraints
inferred← citeshttps://doi.org/10.1287/moor.14.1.60openalex-snapshot
A Strongly Polynomial Algorithm for Minimum Cost Submodular Flow Problems
inferred← citeshttps://doi.org/10.15807/jorsj.31.431openalex-snapshot
A PRIMAL ALGORITHM FOR THE SUBMODULAR FLOW PROBLEM WITH MINIMUM-MEAN CYCLE SELECTION
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.10583openalex-snapshot
Computing Least Cores of Supermodular Cooperative Games
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.1808.07600openalex-snapshot
Discrete Decreasing Minimization, Part I: Base-polyhedra with Applications in Network Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.2008.09838openalex-snapshot
ODDO: Online Duality-Driven Optimization
inferred← citeshttps://doi.org/10.5555/3091125.3091173openalex-snapshot
Supermodular Games on Social 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.