A Structure Theory for the Parametric Submodular Intersection Problem
From MaRDI portal
Recommendations
- Structural theorems for submodular functions, polymatroids and polymatroid intersections
- Structures of subpartitions related to a submodular function minimization
- New algorithms for the intersection problem of submodular systems
- A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences
- scientific article; zbMATH DE number 3865299
- A Structural Approach to Subset-Sum Problems
- Approximation algorithm and its performance for maximizing submodular function subject to matroid intersection
- A strongly polynomial time algorithm for a constrained submodular optimization problem
- Polyhedral results for a class of cardinality constrained submodular minimization problems
- scientific article; zbMATH DE number 3922372
Cited in
(6)- New algorithms for the intersection problem of submodular systems
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
- Theory of principal partitions revisited
- A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences
- Technical Note—Preservation of Supermodularity in Parametric Optimization Problems with Nonlattice Structures
- Structural theorems for submodular functions, polymatroids and polymatroid intersections
This page was built for publication: A Structure Theory for the Parametric Submodular Intersection Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3169048)
