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
Book Section Year : 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

Domains

Computer Science [cs]

Hoai An Le Thi  : Connect in order to contact the contributor

https://hal.univ-lorraine.fr/hal-03213843

Submitted on : Friday, April 30, 2021-4:13:42 PM

Last modification on : Friday, December 22, 2023-3:16:05 PM

No file

Dates and versions

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

Identifiers

Cite

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

INSA-ROUEN COMUE-NORMANDIE UNIV-LORRAINE LMI-ROUEN INSA-GROUPE
11 View
0 Download

Altmetric

Share

More