Author of the publication

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)

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.

 

Other publications of authors with the same name

A polyhedral study of the cardinality constrained knapsack problem., and . Math. Program., 96 (3): 439-467 (2003)A note on the continuous mixing set., and . Oper. Res. Lett., 36 (6): 726-733 (2008)Branch-and-cut for complementarity-constrained optimization., , and . Math. Program. Comput., 6 (4): 365-403 (2014)Facets of the Complementarity Knapsack Polytope., , and . Math. Oper. Res., 27 (1): 210-226 (2002)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)Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms., , and . Math. Program., 98 (1-3): 89-113 (2003)A note on critical-set and lifted surrogate inequalities for cardinality-constrained linear programs., and . Computers & Industrial Engineering, (2015)Models for representing piecewise linear cost functions., , and . Oper. Res. Lett., 32 (1): 44-48 (2004)Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting., , and . Math. Program., 98 (1-3): 115-143 (2003)A Polyhedral Study of the Cardinality Constrained Knapsack Problem., and . IPCO, volume 2337 of Lecture Notes in Computer Science, page 291-303. Springer, (2002)