MILLER, Andrew J.; AKARTUNALI, Kerem

doi:10.1007/s10589-012-9465-z

Métadonnées

Licence d’utilisation du document

MILLER, Andrew J.
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]

AKARTUNALI, Kerem
Department of Management Science [Univ Strathclyde]

Langue

Article de revue

Ce document a été publié dans

Computational Optimization and Applications. 2012, vol. 53, n° 3, p. 729-753

Springer Verlag

Résumé en anglais

In this paper, we analyze a variety of approaches to obtain lower bounds for multi-level production planning problems with big bucket capacities, i.e., problems in which multiple items compete for the same resources. We give an extensive survey of both known and new methods, and also establish relationships between some of these methods that, to our knowledge, have not been presented before. As will be highlighted, understanding the substructures of difficult problems provide crucial insights on why these problems are hard to solve, and this is addressed by a thorough analysis in the paper. We conclude with computational results on a variety of widely used test sets, and a discussion of future research.< Réduire

Métadonnées

Partager cette publication !

Licence d’utilisation du document

A computational analysis of lower bounds for big bucket production planning problems

Langue

Ce document a été publié dans

Résumé en anglais

URI

DOI

Origine

Unités de recherche