From post

Branch, Cut, and Price: Sequential and Parallel.

, , и . Computational Combinatorial Optimization, том 2241 из Lecture Notes in Computer Science, стр. 223-260. Springer, (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

On the Complexity of Selecting Disjunctions in Integer Programming., и . SIAM J. Optimization, 20 (5): 2181-2198 (2010)Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications., , и . International Conference on Computational Science (1), том 2329 из Lecture Notes in Computer Science, стр. 592-602. Springer, (2002)MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library., , , , , , , , , и 6 other автор(ы). Math. Program. Comput., 13 (3): 443-490 (2021)On families of quadratic surfaces having fixed intersections with two hyperplanes., , , , и . Discret. Appl. Math., 161 (16-17): 2778-2793 (2013)Fully Parallel Generic Branch-and-Cut., , , и . PPSC, SIAM, (1997)Bilevel Programming and Maximally Violated Valid Inequalities., и . CTW, стр. 125-134. (2009)Branch, Cut, and Price: Sequential and Parallel., , и . Computational Combinatorial Optimization, том 2241 из Lecture Notes in Computer Science, стр. 223-260. Springer, (2001)Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization., , и . OR, стр. 151-157. Springer, (2017)