Computational experience with an algorithm for 0–1 integer programming
Copyright policy )Computational experience with an algorithm for 0–1 integer programming
AbstractIn a previous paper in this journal, the authors described an implicit enumeration algorithm for the all integer programming problem. In this paper, a specialization of the aforementioned algorithm for 0–1 integer programming problems is developed. The computational efficiency of this specialization is investigated by solving a set of test problems, using a computer code of the algorithm written for this purpose.
- Michigan Technological University United States
- Southern Illinois University Edwardsville United States
Implicit Enumeration Algorithm, Computational Mathematics, All Programming, Numerical mathematical programming methods, Test Problems, Boolean Programming, Computational Theory and Mathematics, Modelling and Simulation, Computational Study, Boolean programming
Implicit Enumeration Algorithm, Computational Mathematics, All Programming, Numerical mathematical programming methods, Test Problems, Boolean Programming, Computational Theory and Mathematics, Modelling and Simulation, Computational Study, Boolean programming
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!