loading...
A New Algorithm for Partner Selection in Virtual Enterprise
Dalian, China December 05-December 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDCAT.2005.22Sixth International Conference on Par ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
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.