From: Using concave optimization methods for inexact quadratic programming problems with an application to waste management
Time span (k = 1)
Time span (k = 2)
Time span (k = 3)
\(RE_{k}^{\pm }\)
[15, 20]
\(TE_{k}^{\pm }\)
[500, 650]