loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)
A New Algorithm for Partner Selection in Virtual Enterprise
Dalian, China
December 05-December 08
ISBN: 0-7695-2405-2
ASCII Text
x 
 
Zhibin Zeng, Yan Li, Shujuan Li, Wenxing Zhu, "A New Algorithm for Partner Selection in Virtual Enterprise," Parallel and Distributed Computing Applications and Technologies, International Conference on, pp. 884-886, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/PDCAT.2005.22,
author = {Zhibin Zeng and Yan Li and Shujuan Li and Wenxing Zhu},
title = {A New Algorithm for Partner Selection in Virtual Enterprise},
journal ={Parallel and Distributed Computing Applications and Technologies, International Conference on},
volume = {0},
year = {2005},
isbn = {0-7695-2405-2},
pages = {884-886},
doi = {http://doi.ieeecomputersociety.org/10.1109/PDCAT.2005.22},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Computing Applications and Technologies, International Conference on
TI - A New Algorithm for Partner Selection in Virtual Enterprise
SN - 0-7695-2405-2
SP884
EP886
A1 - Zhibin Zeng,
A1 - Yan Li,
A1 - Shujuan Li,
A1 - Wenxing Zhu,
PY - 2005
KW - null
VL - 0
JA - Parallel and Distributed Computing Applications and Technologies, International Conference on
ER -
 
Zhibin Zeng, Xi'an University of Technology, Xi'an , China
Yan Li, Xi'an University of Technology, Xi'an , China
Shujuan Li, Xi'an University of Technology, Xi'an , China
Wenxing Zhu, Fuzhou University, Fuzhou, China
The partner selection problem with a due date constraint in virtual enterprises is proved to be NPcompleteness problem. So it cannot have any polynomial time solution algorithm at present. Nonlinear integer programming model for the problem is established. The objective function and constraint function of the model have monotonicity properties. Based on the above observations, a Branch-and-Bound algorithm is constructed to solve the problem. Numerical experiments show that the algorithm is effective.
Citation:
Zhibin Zeng, Yan Li, Shujuan Li, Wenxing Zhu, "A New Algorithm for Partner Selection in Virtual Enterprise," pdcat, pp.884-886, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.