Min-Max partitioning problem with matroid constraint
From MaRDI portal
Recommendations
- Optimal matroid partitioning problems
- Approximation algorithms for k-partitioning problems with partition matroid constraint
- Optimal matroid partitioning problems
- Constrained partitioning problems
- Lower bounds and modified LPT algorithm for \(k\)-partitioning problems with partition matroid constraint
Cites work
- Bounds on Multiprocessing Timing Anomalies
- Capacitated two-parallel machines scheduling to minimize sum of job completion times
- Constrained partitioning problems
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Minimum partition of a matroid into independent subsets
- Optimal partitions
- Optimal Set Partitioning
- The \(k\)-partitioning problem
Cited in
(11)- \(k\)-partitioning problems with partition matroid constraint
- Some constrained partitioning problems and majorization
- Optimal matroid partitioning problems
- Approximation algorithms for k-partitioning problems with partition matroid constraint
- scientific article; zbMATH DE number 1192957 (Why is no real title available?)
- Optimal matroid partitioning problems
- A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem
- Constrained partitioning problems
- Constrained partitioning problems
- 3-partitioning problems for maximizing the minimum load
- Lower bounds and modified LPT algorithm for \(k\)-partitioning problems with partition matroid constraint
This page was built for publication: Min-Max partitioning problem with matroid constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2519447)
