A Branch and Bound Algorithm Based on DC Programming and DCA for Strategic Capacity Planning in Supply Chain Design for a New Market Opportunity

  • Nam N
  • Le An T
  • Tao P
N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Supply chain network are considered as solution for effectively meeting customer requirements such as low cost, high product variety, quality and shorter lead times. The success of a supply chain lies in good strategic and tactical planning and monitoring at the operational level. Strategic planning is long term planning and usually consists in selecting providers and distributors, location and capacity planning of manufacturing/servicing units, among others.

Cite

CITATION STYLE

APA

Nam, N. C., Le An, T. H., & Tao, P. D. (2007). A Branch and Bound Algorithm Based on DC Programming and DCA for Strategic Capacity Planning in Supply Chain Design for a New Market Opportunity. In Operations Research Proceedings 2006 (pp. 515–520). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-69995-8_82

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free