Scheduling meets n-fold integer programming

  title={Scheduling meets n-fold integer programming},
  author={Dusan Knop and Martin Kouteck{\'y}},
  journal={J. Scheduling},
Scheduling problems are fundamental in combinatorial optimization. Much work has been done on approximation algorithms for NP-hard cases, but relatively little is known about exact solutions when some part of the input is a fixed parameter. In 2014, Mnich and Wiese initiated a systematic study in this direction. In this paper we continue this study and show that several additional cases of fundamental scheduling problems are fixed parameter tractable for some natural parameters. Our main tool… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 3 times. VIEW TWEETS


Publications referenced by this paper.
Showing 1-10 of 30 references

Huge Unimodular N-Fold Programs

SIAM J. Discrete Math. • 2015
View 7 Excerpts
Highly Influenced

Scheduling and fixed-parameter tractability

Math. Program. • 2015
View 7 Excerpts
Highly Influenced

Bin packing with fixed number of bins revisited

View 17 Excerpts
Highly Influenced

Integer Optimization on Convex Semialgebraic Sets

Discrete & Computational Geometry • 2000
View 4 Excerpts
Highly Influenced

The third comprehensive survey on scheduling problems with setup times/costs

European Journal of Operational Research • 2015
View 9 Excerpts
Highly Influenced

N-fold integer programming in cubic time

View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…