Matroid optimization with generalized constraints
From MaRDI portal
Recommendations
- A multiply constrained matroid optimization problem
- Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems
- Optimization problems with color-induced budget constraints
- A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
- Optimization problems with color-induced budget constraints
Cites work
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A multiply constrained matroid optimization problem
- Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems
- Efficient algorithms for a family of matroid intersection problems
- Fibonacci heaps and their uses in improved network optimization algorithms
- Matroid optimization with the interleaving of two ordered sets
Cited in
(12)- Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
- Shifted matroid optimization
- Optimization problems with color-induced budget constraints
- Biobjective optimization problems on matroids with binary costs
- A Parameterized View on Matroid Optimization Problems
- Matroid optimization problems with monotone monomials in the objective
- scientific article; zbMATH DE number 3946155 (Why is no real title available?)
- Least and most colored bases
- A multiply constrained matroid optimization problem
- Setup optimization problems with matroid structure
- Optimization problems with color-induced budget constraints
This page was built for publication: Matroid optimization with generalized constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1902899)
