期刊名称：Relatórios de Pesquisa em Engenharia de Produção
电子版ISSN：1678-2399
出版年度：2005
卷号：5
出版社：Universidade Federal Fluminense (UFF)
摘要：Branch-and-Cut-and-Price (BCP) algorithms are branch-and-bound algo-rithms where both row generation (separation) and column generation (pric-ing) are performed. Following [12], we say that such an algorithm is ro-bust when the separation and pricing subproblems are guaranteed to remaintractable during its execution. Robust BCP algorithms have been devisedrecently for a variety of problems, having been particularly successful forthe Capacitated Vehicle Routing Problem (CVRP) [7] and the CapacitatedMinimum Spanning Tree Problem (CMSTP) [6], for which many standardtest instances have been solved for the first time.
