A revised Taha's algorithm for polynomial 0-1 programming

Polynomial 0-1 programming has been undoubtedly playing a central role in nonlinear integer programming. There is, however, a clear need to develop more efficient exact algorithms for general polynomial 0-1 programming. The original version of the Taha's implicit enumeration method can only dea...

Full description

Saved in:
Bibliographic Details
Published inOptimization Vol. 56; no. 5-6; pp. 699 - 713
Main Authors Wang, J., Li, D., Sun, X. L.
Format Journal Article
LanguageEnglish
Published Philadelphia Taylor & Francis Group 01.10.2007
Taylor & Francis LLC
Subjects
Algorithms
Implicit enumeration
Integer programming
Mathematics Subject Classifications 2000
Polynomial 0-1 programming
Polynomials
Studies
Online AccessGet full text
ISSN0233-1934
1029-4945
DOI10.1080/02331930701617148

Cover

More Information
Summary:Polynomial 0-1 programming has been undoubtedly playing a central role in nonlinear integer programming. There is, however, a clear need to develop more efficient exact algorithms for general polynomial 0-1 programming. The original version of the Taha's implicit enumeration method can only deal with polynomial 0-1 programming problems with coefficients in the objective function being all nonnegative. This article considers an extended version of the Taha's method for general polynomial 0-1 programming problems and presents an efficient implicit enumeration algorithm by systematically investigating schemes for "fathoming", "consistency checking" and "augmenting". Promising computational results are reported. ¶Dedicated to the memory of Prof. Dr Alexander Moiseevich Rubinov.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0233-1934
1029-4945
DOI:10.1080/02331930701617148