Article ID Journal Published Year Pages File Type
6898046 European Journal of Operational Research 2013 9 Pages PDF
Abstract
► Positive convex Half-Product problem is studied, with and without a linear constraint. ► A constant ration approximation algorithm and an FPTAS are derived. ► The running times depend quadratically on the number of variables. ► Several scheduling applications are presented.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Preview
Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product
Authors
, ,