Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4637100 | Applied Mathematics and Computation | 2006 | 13 Pages |
Abstract
In this paper, the partner selection problem with a due date constraint in virtual enterprises is proved to be an NP-complete problem. So it cannot have any polynomial time solution algorithm at present. A nonlinear integer programming model for this problem is established. The objective function and a constraint function of the model have monotone properties. Based on the above observations, a Branch & Bound algorithm is constructed to solve the problem. Numerical experiments show that the algorithm is efficient.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Zhi-Bin Zeng, Yan Li, Wenxing Zhu,