A Branch and Bound Algorithm Based on DC Programming and DCA for Strategic Capacity Planning in Supply Chain Design for a New Market Opportunity (Q5391847): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-69995-8_82 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1483454527 / rank | |||
Normal rank | |||
Latest revision as of 21:38, 19 March 2024
scientific article; zbMATH DE number 5875849
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Branch and Bound Algorithm Based on DC Programming and DCA for Strategic Capacity Planning in Supply Chain Design for a New Market Opportunity |
scientific article; zbMATH DE number 5875849 |
Statements
A Branch and Bound Algorithm Based on DC Programming and DCA for Strategic Capacity Planning in Supply Chain Design for a New Market Opportunity (English)
0 references
7 April 2011
0 references
