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

DOI10.1007/978-3-540-69995-8_82zbMath1209.90047OpenAlexW1483454527MaRDI QIDQ5391847

Hoai An Le Thi, Tao Pham Dinh, Nam Nguyen Canh

Publication date: 7 April 2011

Published in: Operations Research Proceedings 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69995-8_82

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

DC programming and DCA: thirty years of developments

This page was built for publication: A Branch and Bound Algorithm Based on DC Programming and DCA for Strategic Capacity Planning in Supply Chain Design for a New Market Opportunity