Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications

Hans Kellerer () and Vitaly A. Strusevich ()
Additional contact information
Hans Kellerer: Universität Graz
Vitaly A. Strusevich: University of Greenwich

Annals of Operations Research, 2016, vol. 240, issue 1, No 4, 39-94

Abstract: Abstract This paper reviews the problems of Boolean non-linear programming related to the half-product problem. All problems under consideration have a similar quadratic non-separable objective function. For these problems, we focus on the development of fully polynomial-time approximation schemes, especially of those with strongly polynomial time, and on their applications to various scheduling problems.

Keywords: Quadratic knapsack; Half-product; Single machine scheduling; FPTAS (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-015-2018-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:240:y:2016:i:1:d:10.1007_s10479-015-2018-y

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-015-2018-y

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().