Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481494 | European Journal of Operational Research | 2009 | 7 Pages |
Abstract
For 0–1 problems, we propose an exact Branch and Bound procedure where branching strategy is based on empirical distribution of each variable within three intervals [0,ϵ],[ϵ,1-ϵ],[1-ϵ,1][0,ϵ],[ϵ,1-ϵ],[1-ϵ,1] under the linear relaxation model. We compare the strategy on multiknapsack and maximum clique problems with other heuristics.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
D. Fortin, I. Tseveendorj,