A Branch and Bound Algorithm Based on DC Programming and DCA for Strategic Capacity Planning in Supply Chain Design for a New Market Opportunity - Université de Lorraine Accéder directement au contenu
Chapitre D'ouvrage Année : 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

Fichier non déposé

Dates et versions

hal-03213843 , version 1 (30-04-2021)

Identifiants

Citer

Nguyen Canh Nam, Hoai An Le Thi, Tao Pham Dinh. A Branch and Bound Algorithm Based on DC Programming and DCA for Strategic Capacity Planning in Supply Chain Design for a New Market Opportunity. Operations Research Proceedings 2006. Operations Research Proceedings,, 2006, pp.515-520, 2007, ⟨10.1007/978-3-540-69995-8_82⟩. ⟨hal-03213843⟩
11 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More