On the public citation graph

Submodular systems and related topics

https://doi.org/10.1007/bfb0121012
0 signed · 105 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/978-0-8176-4842-8_5openalex-snapshot
On the Abstract Properties of Linear Dependence1
inferredcites →https://doi.org/10.1007/978-3-642-46216-0openalex-snapshot
Convexity and Optimization in Finite Dimensions I
inferredcites →https://doi.org/10.1007/978-3-642-68874-4_10openalex-snapshot
Submodular functions and convexity
inferredcites →https://doi.org/10.1007/978-3-642-68874-4_8openalex-snapshot
Applications of Matroid Theory
inferredcites →https://doi.org/10.1007/bf01580381openalex-snapshot
Finding the nearest point in A polytope
inferredcites →https://doi.org/10.1007/bf01584082openalex-snapshot
Matroids and the greedy algorithm
inferredcites →https://doi.org/10.1007/bf01753431openalex-snapshot
Cores of convex games
inferredcites →https://doi.org/10.1007/bf02579270openalex-snapshot
How to make a digraph strongly connected
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1016/0012-365x(79)90092-xopenalex-snapshot
The greedy algorithm for partially ordered sets
inferredcites →https://doi.org/10.1016/0012-365x(82)90044-9openalex-snapshot
A note on k-strongly connected orientations of an undirected graph
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/0041-5553(80)90098-1openalex-snapshot
The polynomial solvability of convex quadratic programming
inferredcites →https://doi.org/10.1016/0095-8956(80)90054-4openalex-snapshot
Geometries on partially ordered sets
inferredcites →https://doi.org/10.1016/0095-8956(84)90023-6openalex-snapshot
Testing membership in matroid polyhedra
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/0166-218x(83)90040-9openalex-snapshot
Canonical decompositions of symmetric submodular systems
inferredcites →https://doi.org/10.1016/0166-218x(84)90117-3openalex-snapshot
A note on Frank's generalized polymatroids
inferredcites →https://doi.org/10.1016/b978-0-12-566780-7.50018-0openalex-snapshot
Structural Theory for the Combinatorial Systems Characterized by Submodular Functions
inferredcites →https://doi.org/10.1016/b978-0-444-86893-0.50022-xopenalex-snapshot
MATROIDS FROM CROSSING FAMILIES
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)72451-4openalex-snapshot
Flow Network Formulations of Polymatroid Optimization Problems
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.1017/s0305004100051677openalex-snapshot
Rado's theorem for polymatroids
inferredcites →https://doi.org/10.1080/00207728108963728openalex-snapshot
Use of matroid theory in operations research, circuits and systems theory
inferredcites →https://doi.org/10.1090/psapm/010/0114759openalex-snapshot
Some recent applications of the theory of linear inequalities to extremal combinatorial analysis
inferredcites →https://doi.org/10.1090/s0002-9947-1958-0101526-0openalex-snapshot
A Homotopy Theorem for Matroids, I
inferredcites →https://doi.org/10.1090/s0002-9947-1959-0101527-3openalex-snapshot
Matroids and graphs
inferredcites →https://doi.org/10.1090/tranopenalex-snapshot
Transactions of the American Mathematical Society
inferredcites →https://doi.org/10.1111/j.1749-6632.1979.tb32805.xopenalex-snapshot
A REVIEW OF RECENT WORK IN JAPAN ON PRINCIPAL PARTITIONS OF MATROIDS AND THEIR APPLICATIONS1
inferredcites →https://doi.org/10.1215/s0012-7094-37-00334-xopenalex-snapshot
Rings of sets
inferredcites →https://doi.org/10.1287/moor.10.3.367openalex-snapshot
The Partial Order of a Polymatroid Extreme Point
inferredcites →https://doi.org/10.1287/moor.5.2.186openalex-snapshot
Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
inferredcites →https://doi.org/10.1287/moor.7.3.334openalex-snapshot
Computing Maximal “Polymatroidal” Network Flows
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.15807/jorsj.21.189openalex-snapshot
ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
inferredcites →https://doi.org/10.15807/jorsj.26.309openalex-snapshot
A NOTE ON SUBMODULAR FUNCTIONS ON DISTRIBUTIVE LATTICES
inferredcites →https://doi.org/10.2307/2371182openalex-snapshot
On the Abstract Properties of Linear Dependence
inferredcites →https://doi.org/10.6028/jres.069b.001openalex-snapshot
Lectures on matroids

What points at this work

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

inferred← citeshttps://doi.org/10.1006/aama.2000.0702openalex-snapshot
Extension of M-Convexity and L-Convexity to Polyhedral Convex Functions
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_60openalex-snapshot
Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
inferred← citeshttps://doi.org/10.1007/3-540-61310-2_19openalex-snapshot
A submodular optimization problem with side constraints
inferred← citeshttps://doi.org/10.1007/978-1-4899-3558-8_28openalex-snapshot
Dilworth’s Completion, Submodular Functions, and Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-72792-7_20openalex-snapshot
On Convex Minimization over Base Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-7908-1838-3_4openalex-snapshot
Fuzzy Graphs and Shortest Paths
inferred← citeshttps://doi.org/10.1007/bf01192524openalex-snapshot
Principal structure of submodular systems and hitchcock-type independent flows
inferred← citeshttps://doi.org/10.1007/bf01261329openalex-snapshot
Principal structure of submodular systems and Hitchcock-type independent flows
inferred← citeshttps://doi.org/10.1007/bf01415939openalex-snapshot
Cores of games with restricted cooperation
inferred← citeshttps://doi.org/10.1007/bf01581271openalex-snapshot
Structure of a simple scheduling polyhedron
inferred← citeshttps://doi.org/10.1007/bf01585863openalex-snapshot
Minimizing symmetric submodular functions
inferred← citeshttps://doi.org/10.1007/bf01589418openalex-snapshot
Generalized polymatroids and submodular flows
inferred← citeshttps://doi.org/10.1007/bf01589420openalex-snapshot
Directed submodularity, ditroids and directed submodular flows
inferred← citeshttps://doi.org/10.1007/bf01721246openalex-snapshot
Recent trends in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/bf02888587openalex-snapshot
Juegos con corazon no vacio. Una nueva caracterizacion
inferred← citeshttps://doi.org/10.1007/bf03167143openalex-snapshot
An algorithm for the fair resource allocation problem with a submodular constraint
inferred← citeshttps://doi.org/10.1007/s10107-006-0084-2openalex-snapshot
Submodular function minimization
inferred← citeshttps://doi.org/10.1007/s13160-012-0083-zopenalex-snapshot
Equivalence of convex minimization problems over base polytopes
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/0022-247x(86)90175-7openalex-snapshot
A Mazur-Orlicz type theorem for submodular set functions
inferred← citeshttps://doi.org/10.1016/0024-3795(84)90147-2openalex-snapshot
A system of linear inequalities with a submodular function on {0,±1}; vectors
inferred← citeshttps://doi.org/10.1016/0165-0114(91)90063-vopenalex-snapshot
Fuzzy shortest paths
inferred← citeshttps://doi.org/10.1016/0166-218x(84)90117-3openalex-snapshot
A note on Frank's generalized polymatroids
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/0167-6377(91)90027-mopenalex-snapshot
A dual algorithm for submodular flow problems
inferred← citeshttps://doi.org/10.1016/0167-6377(94)90019-1openalex-snapshot
An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane
inferred← citeshttps://doi.org/10.1016/b978-0-12-701225-4.50017-3openalex-snapshot
RETRACTED: References
inferred← citeshttps://doi.org/10.1016/j.dam.2002.11.010openalex-snapshot
Permutation polytopes corresponding to strongly supermodular functions
inferred← citeshttps://doi.org/10.1016/s0096-3003(97)10043-1openalex-snapshot
An approximate algorithm for computing multidimensional convex hulls
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00285-7openalex-snapshot
A strongly polynomial time algorithm for a constrained submodular optimization problem
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.1016/s0167-5060(08)70684-8openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12007-6openalex-snapshot
Submodular Function Minimization
inferred← citeshttps://doi.org/10.1023/a:1012757316376openalex-snapshot
Matroids
inferred← citeshttps://doi.org/10.1080/02522667.1995.10699207openalex-snapshot
Lexicographically Optimal Base of a Submodular System with respect to a Weight Vector
inferred← citeshttps://doi.org/10.1109/icassp.2014.6854213openalex-snapshot
Submodular subset selection for large-scale speech training data
inferred← citeshttps://doi.org/10.1109/ieeeconf56349.2022.10052065openalex-snapshot
Hypergraph 1-Spectral Clustering with General Submodular Weights
inferred← citeshttps://doi.org/10.1109/tpami.2025.3598031openalex-snapshot
Efficient Benchmarking via Bias-Bounded Subset Selection
inferred← citeshttps://doi.org/10.1109/twc.2020.2988382openalex-snapshot
A Dynamic Clustering Algorithm for Multi-Point Transmissions in Mission-Critical Communications
inferred← citeshttps://doi.org/10.1137/140978296openalex-snapshot
A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives
inferred← citeshttps://doi.org/10.1142/9789814324359_0173openalex-snapshot
Submodular Functions: Optimization and Approximation
inferred← citeshttps://doi.org/10.1145/2213977.2213981openalex-snapshot
Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
inferred← citeshttps://doi.org/10.1145/335305.335317openalex-snapshot
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
inferred← citeshttps://doi.org/10.1145/4221.4998openalex-snapshot
On ordered languages and the optimization of linear functions by greedy algorithms
inferred← citeshttps://doi.org/10.1145/502090.502096openalex-snapshot
A combinatorial strongly polynomial algorithm for minimizing submodular functions
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.1287/moor.23.3.661openalex-snapshot
A Submodular Optimization Problem with Side Constraints
inferred← citeshttps://doi.org/10.14288/1.0070919openalex-snapshot
Appointment scheduling with discrete random durations and applications
inferred← citeshttps://doi.org/10.15807/jorsj.27.112openalex-snapshot
A CHARACTERIZATION OF FACES OF THE BASE POLYHEDRON ASSOCIATED WITH A SUBMODULAR SYSTEM
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.15807/jorsj.33.188openalex-snapshot
A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE
inferred← citeshttps://doi.org/10.15807/jorsj.33.46openalex-snapshot
AN ε-APPROXIMATION SCHEME FOR MINIMUM VARIANCE PROBLEMS
inferred← citeshttps://doi.org/10.23919/eusipco.2017.8081324openalex-snapshot
Data subset selection for efficient SVM training
inferred← citeshttps://doi.org/10.48550/arxiv.1110.4882openalex-snapshot
Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
inferred← citeshttps://doi.org/10.48550/arxiv.1411.0095openalex-snapshot
Provable Submodular Minimization using Wolfe's Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1506.02852openalex-snapshot
Active-set Methods for Submodular Minimization Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1512.08602openalex-snapshot
Tight Bounds for Approximate Carathéodory and Beyond
inferred← citeshttps://doi.org/10.5555/313651.313669openalex-snapshot
A combinatorial algorithm for minimizing symmetric submodular functions
inferred← citeshttps://doi.org/10.68381/jca14002openalex-snapshot
Subgradients of Convex Games and Public Good Games
inferred← citeshttps://doi.org/10.70675/001d63d1z9278z4d43z860dz211b03b6d23fopenalex-snapshot
Optimisation des réseaux cellulaires pour les communications professionnelles critiques
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.