Show simple item record

dc.contributor.authorVizvári, B.en_US
dc.contributor.authorYilmaz F.en_US
dc.date.accessioned2016-02-08T10:52:50Z
dc.date.available2016-02-08T10:52:50Z
dc.date.issued1994en_US
dc.identifier.issn0925-5001
dc.identifier.urihttp://hdl.handle.net/11693/25949
dc.description.abstractIn this paper, a new algorithm to solve a general 0-1 programming problem with linear objective function is developed. Computational experiences are carried out on problems where the constraints are inequalities on polynomials. The solution of the original problem is equivalent with the solution of a sequence of set packing problems with special constraint sets. The solution of these set packing problems is equivalent with the ordering of the binary vectors according to their objective function value. An algorithm is developed to generate this order in a dynamic way. The main tool of the algorithm is a tree which represents the desired order of the generated binary vectors. The method can be applied to the multi-knapsack type nonlinear 0-1 programming problem. Large problems of this type up to 500 variables have been solved. © 1994 Kluwer Academic Publishers.en_US
dc.language.isoEnglishen_US
dc.source.titleJournal of Global Optimizationen_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/BF01096457en_US
dc.subjectenumerationen_US
dc.subjectglobal optimumen_US
dc.subjectlexicographic orderen_US
dc.subjectNonlinear integer programmingen_US
dc.titleAn ordering (enumerative) algorithm for nonlinear 0-1 programmingen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage277en_US
dc.citation.epage290en_US
dc.citation.volumeNumber5en_US
dc.citation.issueNumber3en_US
dc.identifier.doi10.1007/BF01096457en_US
dc.publisherKluwer Academic Publishersen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record