Parallel branch, cut, and price for large-scale discrete optimization.

Autor:	Ralphs, T. K., Ladányi, L., Saltzman, M. J.
Předmět:	ALGORITHMS BRANCHING processes PRICES MATHEMATICAL optimization MATHEMATICAL programming MATHEMATICS
Zdroj:	Mathematical Programming; Sep2003, Vol. 98 Issue 1-3, p253-280, 28p, 2 Diagrams, 8 Graphs
Abstrakt:	Examines the parallelizing of branch, cut and price algorithms. Reason for the difficulty to parallelize branch, cut and price algorithms; Issues involved in parallelizing algorithms; Implementation of SYMPHONY and COIN/BCP; Description of the next-generation framework.
Databáze:	Complementary Index
Externí odkaz:	Zobrazit plný text záznamu