Back to Search
Start Over
Partner selection with a due date constraint in virtual enterprises
- Source :
-
Applied Mathematics & Computation . Apr2006, Vol. 175 Issue 2, p1353-1365. 13p. - Publication Year :
- 2006
-
Abstract
- 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 00963003
- Volume :
- 175
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Applied Mathematics & Computation
- Publication Type :
- Academic Journal
- Accession number :
- 20524264
- Full Text :
- https://doi.org/10.1016/j.amc.2005.08.022