A branch and bound algorithm based on DC programming and DCA for strategic capacity planning in supply chain design for a new market opportunity
| Year of publication: |
2007
|
|---|---|
| Authors: | Nam, Nguyen Canh ; Le Thi Hoai An ; Pham Dinh Tao |
| Published in: |
Operations research proceedings 2006 : selected papers of the Annual International Conference of the German Operations Research Society (GOR), jointly organized with the Austrian Society of Operations Research (ÖGOR) and the Swiss Society of Operations Research (SVOR), Karlsruhe, September 6 - 8 2006 ; with 79 tables. - Berlin : Springer, ISBN 3-540-69994-5. - 2007, p. 515-520
|
| Subject: | Lieferkette | Supply chain | Mathematische Optimierung | Mathematical programming | Kapazitätsplanung | Capacity planning | Branch-and-Bound | Branch and Bound |
-
A stochastic model to study the system capacity for supply chains in terms of minimal cuts
Lin, Yi-kuei, (2010)
-
A branch-and-bound algorithm for the concave cost supply problem
Yenipazarli, Arda, (2016)
-
Integer programming models for mid-term production planning for high-tech low-volume supply chains
Kruijff, Joost T. de, (2018)
- More ...
-
DC programming and DCA for globally solving the value-at-risk
Pham Dinh Tao, (2009)
-
Modeling and computational optimization for complex system management
Le Thi Hoai An, (2017)
-
Le Thi Hoai An, (2009)
- More ...