![Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5933/TOC-Subject-Sample-2021-Engineering-Tech.jpg"})
In this work an algorithm is presented to solve the zero-one programming problem with special additional constraints. Rules for the unique generation of index sets corresponding to the vectors x ∊ R
n, x
j∊{0,1}, j = 1(1) n are given. Thereby only such index sets are generated, which fulfill the additional constraints. The number of generated index sets is reduced by means of tests, which suit to the problem.
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.