( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Branch-and-Price: Column Generation for Solving Huge Integer Programs

, , , , и . Operations Research, 46 (3): pp. 316-329 (1998)

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.

George Mertzios

Combinatorial optimization and recognition of graph classes with applications to related models. TU Aachen, (2009)

L Solymosi

L Bräuer

L Müller

L Eberl

 

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

Hooked on IP.. Ann. Oper. Res., 149 (1): 157-161 (2007)Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms., , и . IPCO, том 2337 из Lecture Notes in Computer Science, стр. 161-175. Springer, (2002)Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints., и . IPCO, том 5035 из Lecture Notes in Computer Science, стр. 199-213. Springer, (2008)Integer and Combinatorial Optimization, и . Wiley-Interscience, New York, NY, 1 издание, (ноября 1999)MINTO, a mixed INTeger optimizer., , и . Oper. Res. Lett., 15 (1): 47-58 (1994)Branch-and-Price: Column Generation for Solving Huge Integer Programs, , , , и . Operations Research, 46 (3): pp. 316-329 (1998)A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem., , , и . CPAIOR, том 10848 из Lecture Notes in Computer Science, стр. 289-297. Springer, (2018)A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case., , и . Math. Program., 95 (1): 71-90 (2003)How important are branching decisions: Fooling MIP solvers., и . Oper. Res. Lett., 43 (3): 273-278 (2015)Valid Inequalities for Problems with Additive Variable Upper Bounds., , и . IPCO, том 1610 из Lecture Notes in Computer Science, стр. 60-72. Springer, (1999)