Partner selection with a due date constraint in virtual enterprises

DOI10.1016/j.amc.2005.08.022zbMath1096.65057OpenAlexW2019722654MaRDI QIDQ2493713

Yan Li, Zhi-Bin Zeng, Wen-Xing Zhu

Publication date: 16 June 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.08.022

zbMATH Keywords

nonlinear integer programmingnumerical experimentsbranch and bound algorithmpartner selectionvirtual enterprise

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)

Related Items (3)

C-Rank——Core algorithm of enterprises search engine in manufacturing industry chain based on ASP ⋮ Restricting weights in supplier selection decisions in the presence of dual-role factors ⋮ Discrete-event simulation for evaluating virtual organizations

Cites Work

• Supply chain partnerships: Opportunities for operations research
• A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
• Genetic algorithm solution for a risk-based partner selection problem in a virtual enterprise
• Agile manufacturing: Enablers and an implementation framework
• Unnamed Item
• Unnamed Item

This page was built for publication: Partner selection with a due date constraint in virtual enterprises