( en | de | ru )

 

Disambiguation of "Nemhauser, George L."

Author of the publication

copydeleteadd this publication to your clipboard
A Robust Fleet-Assignment Model with Hub Isolation and Short Cycles.

, , and . Transp. Sci., 38 (3): 357-368 (2004)

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. You can also use the button next to the name to display some publications already assigned to the person.

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

 

Other publications of authors with the same name

MINTO, a mixed INTeger optimizer., , and . Oper. Res. Lett., 15 (1): 47-58 (1994)Branch-and-Price: Column Generation for Solving Huge Integer Programs, , , , and . Operations Research, 46 (3): pp. 316-329 (1998)Integer and Combinatorial Optimization, and . Wiley-Interscience, New York, NY, 1 edition, (November 1999)Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints., and . IPCO, volume 5035 of Lecture Notes in Computer Science, page 199-213. Springer, (2008)Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms., , and . IPCO, volume 2337 of Lecture Notes in Computer Science, page 161-175. Springer, (2002)Hooked on IP.. Ann. Oper. Res., 149 (1): 157-161 (2007)A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem., , , and . CPAIOR, volume 10848 of Lecture Notes in Computer Science, page 289-297. Springer, (2018)Valid Inequalities for Problems with Additive Variable Upper Bounds., , and . IPCO, volume 1610 of Lecture Notes in Computer Science, page 60-72. Springer, (1999)Estimating the size of search trees by sampling with domain knowledge., , , , and . IJCAI, page 473-479. ijcai.org, (2017)A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case., , and . Math. Program., 95 (1): 71-90 (2003)