A Lagrangian bound for many-to-many assignment problems

作者:Litvinchev Igor; Rangel Socorro*; Saucedo Jania
来源:Journal of Combinatorial Optimization, 2010, 19(3): 241-257.
DOI:10.1007/s10878-008-9196-3

摘要

A simple procedure to tighten the Lagrangian bounds is proposed. The approach is interpreted in two ways. First, it can be seen as a reformulation of the original problem aimed to split the resulting Lagrangian problem into two subproblems. Second, it can be considered as a search for a tighter estimation of the penalty term arising in the Lagrangian problem. The new bounds are illustrated by a small example and studied numerically for a class of the generalized assignment problems.

  • 出版日期2010-4