Author of the publication

On-Line Algorithms for Cardinality Constrained Bin Packing Problems.

, , , and . ISAAC, volume 2223 of Lecture Notes in Computer Science, page 695-706. Springer, (2001)

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

On-Line Algorithms for Cardinality Constrained Bin Packing Problems., , , and . ISAAC, volume 2223 of Lecture Notes in Computer Science, page 695-706. Springer, (2001)Semi-on-line multiprocessor scheduling with given total processing time., , and . Theor. Comput. Sci., 337 (1-3): 134-146 (2005)Maximum travelling salesman problem., and . Math. Meth. of OR, 43 (2): 169-181 (1996)The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications., , , and . Discrete Applied Mathematics, 157 (8): 1806-1824 (2009)Semi on-line algorithms for the partition problem., , , and . Oper. Res. Lett., 21 (5): 235-242 (1997)An efficient algorithm for semi-online multiprocessor scheduling with given total processing time., , and . J. Scheduling, 18 (6): 623-630 (2015)General parametric scheme for the online uniform machine scheduling problem with two different speeds., , , and . Inf. Process. Lett., (2018)Algorithms for on-line bin-packing problems with cardinality constraints., , , and . Discrete Applied Mathematics, 143 (1-3): 238-251 (2004)Online bin stretching with bunch techniques., , and . Theor. Comput. Sci., (2015)The Stock Size Problem., , , and . Operations Research, 46 (3-Supplement-3): S1-S12 (1998)