( en | de | ru )

 

Disambiguation of "Nemhauser, George L."

Author of the publication

copydeleteadd this publication to your clipboard
A parallel local search framework for the Fixed-Charge Multicommodity Network Flow problem.

, , , , , and . Comput. Oper. Res., (2017)

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 Bräuer

L Solymosi

L Müller

L Eberl

 

Other publications of authors with the same name

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)Branch-and-cut for combinatorial optimization problems without auxiliary binary variables., , and . Knowledge Eng. Review, 16 (1): 25-39 (2001)Price-Directed Control of Remnant Inventory Systems., and . Operations Research, 47 (6): 889-898 (1999)Lifted cover facets of the 0-1 knapsack polytope with GUB constraints., and . Oper. Res. Lett., 16 (5): 255-263 (1994)How important are branching decisions: Fooling MIP solvers., and . Oper. Res. Lett., 43 (3): 273-278 (2015)A generalized assignment problem with special ordered sets: a polyhedral approach., , and . Math. Program., 89 (1): 187-203 (2000)A Problem in Bulk Service Scheduling., and . Operations Research, 20 (4): 813-819 (1972)An abstract model for branching and its application to mixed integer programming., and . Math. Program., 166 (1-2): 369-405 (2017)Valid Inequalities for Problems with Additive Variable Upper Bounds., , and . IPCO, volume 1610 of Lecture Notes in Computer Science, page 60-72. Springer, (1999)Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems., , , and . INFORMS J. Comput., 34 (2): 1086-1114 (2022)