Author of the publication

Approximation Algorithms for Knapsack Problems with Cardinality Constraints

, , , and . European Journal of Operational Research, (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. 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

Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing., , and . Math. Oper. Res., 30 (1): 150-172 (2005)Approximation Schemes for Ordered Vector Packing Problems., , and . RANDOM-APPROX, volume 2129 of Lecture Notes in Computer Science, page 63-74. Springer, (2001)On the Practical Solution of the Reversal Median Problem.. WABI, volume 2149 of Lecture Notes in Computer Science, page 238-251. Springer, (2001)Packing Cycles and Cuts in Undirected Graphs., , and . ESA, volume 2161 of Lecture Notes in Computer Science, page 512-523. Springer, (2001)A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing., , and . SIAM J. Comput., 39 (4): 1256-1278 (2009)A column-generation based branch-and-bound algorithm for sorting by reversals., , and . Mathematical Support for Molecular Biology, volume 47 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 213-226. DIMACS/AMS, (1998)Solution of the Train Platforming Problem., , and . ATMOS, volume 7 of OASIcs, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2007)Formulations and hardness of multiple sorting by reversals.. RECOMB, page 84-94. ACM, (1999)Robustness in Train Timetabling., , and . CTW, page 171-174. (2009)The Reversal Median Problem.. INFORMS J. Comput., 15 (1): 93-113 (2003)