A branch-and-bound algorithm for the concave cost supply problem
Year of publication: |
1-15 July 2016
|
---|---|
Authors: | Yenipazarli, Arda ; Benson, Harold P. ; Erenguc, Selcuk |
Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 54.2016, 13/14 (1/15.7.), p. 3943-3961
|
Subject: | supply management | concave cost | global optimisation | branch and bound | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | Lieferkette | Supply chain |
-
A branch and efficiency algorithm for the optimal design of supply chain networks
Petridis, Konstantinos, (2017)
-
Ozturk, Onur, (2017)
-
Exact algorithms for the solution of the grey pattern quadratic assignment problem
Drezner, Zvi, (2015)
- More ...
-
Dynamic lot-sizing with setup cost reduction
Denizel, Meltem, (1997)
-
Dynamic lot-sizing with setup cost reduction
Denizel, Meltem, (1997)
-
A neurogenetic approach for the resource-constrained project scheduling problem
Agarwal, Anurag, (2011)
- More ...