The knapsack problem with scheduled items
References (12)
- et al.
The nonlinear knapsack problem–algorithms and applications
European Journal of Operational Research
(2002) - et al.
A new exact approach for the 0–1 collapsing knapsack problem
European Journal of Operational Research
(2017) - et al.
Approximation schemes for the parametric knapsack problem
Information Processing Letters
(2017) The quadratic knapsack problem—a survey
Discrete applied mathematics
(2007)- et al.
Scheduling commercials on broadcast television
Operations Research
(2004) - et al.
The TV advertisements scheduling problem
Optimization Letters
(2018)
There are more references available in the full text version of this article.
Cited by (3)
On the local dominance properties in single machine scheduling problems
2024, Annals of Operations ResearchOn the Local Dominance Properties in Single Machine Scheduling Problems
2022, International Conference on Operations Research and Enterprise SystemsThe traveling analyst problem: Definition and preliminary study
2020, CEUR Workshop Proceedings
© 2018 Elsevier B.V. All rights reserved.