Algorithms and complexity for scheduling and packing problems

MaRDI QIDQ4605682zbMATH OpenFDO

Authors Michael Hopf

Publication date 27 February 2018

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Abstract computational complexity for mathematical programming problems (90C60)

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

Cited in

(1)

• Algorithms for packing problems

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)