Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem

Author： Pimentel Carina Maria Oliveira   Alvelos Filipe Pereira   Valerio de Carvalho Jose  

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.25, Iss.2, 2010-04, pp. : 299-319

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Improved lower bounds for the capacitated lot sizing problem with setup times

By Jans R.   Degraeve Z.  

Operations Research Letters, Vol. 32, Iss. 2, 2004-03 ,pp. : 185-195

Elsevier

Access to resources Recommend Favorite

A branch‐and‐price algorithm for the (k,c)‐coloring problem

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 4, 2015-07 ,pp. : 353-366

John Wiley & Sons Inc

Access to resources Recommend Favorite

Multi-Item, Multi-Facility Supply Chain Planning: Models, Complexities, and Algorithms

By Wu S. David   Golbasi Hakan  

Computational Optimization and Applications, Vol. 28, Iss. 3, 2004-09 ,pp. : 325-356

Springer Publishing Company

Access to resources Recommend Favorite

Heuristics for the joint multi-item replenishment problem under trade credits

By Tsao Yu-Chung  

IMA Journal of Management Mathematics, Vol. 24, Iss. 1, 2013-01 ,pp. : 63-77

Oxford University Press

Access to resources Recommend Favorite

Branch-and-Cut-and-Price for Capacitated Connected Facility Location

By Leitner Markus  

Journal of Mathematical Modelling and Algorithms, Vol. 10, Iss. 3, 2011-09 ,pp. : 245-267

Springer Publishing Company

Access to resources Recommend Favorite