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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
