Algorithms and complexity for scheduling and packing problems
From MaRDI portal
Recommendations
- Approximation algorithms for scheduling and packing problems
- scientific article; zbMATH DE number 2038780
- On Multidimensional Packing Problems
- Performance bounds of algorithms for scheduling advertisements on a web page
- Combinations of some shop scheduling problems and the shortest path problem: complexity and approximation algorithms
This page was built for publication: Algorithms and complexity for scheduling and packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4605682)