期刊名称：Relatórios de Pesquisa em Engenharia de Produção
电子版ISSN：1678-2399
出版年度：2004
卷号：4
出版社：Universidade Federal Fluminense (UFF)
摘要：The Generalized Assignment Problem (GAP) is a classic schedulingproblem with many applications. We propose a branch-and-cut-and-price for that problem featuring a stabilization mechanism to acceleratecolumn generation convergence. We also propose ellipsoidal cuts, a newway of transforming the exact algorithm into a powerful heuristic, inthe same spirit of the cuts recently proposed by Fischetti and Lo di.The improved solutions found by this heuristic can, in turn, help thetask of the exact algorithm. The resulting algorithms showed a verygo od performance and were able to solve three among the last five openinstances from the OR-Library
