PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Fleszar, Krzysztof"

Author of the publication

copydeleteadd this publication to your clipboard
Minimum Rectilinear Polygons for Given Angle Sequences.

, , , , , and . CoRR, (2016)

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.

Univ. -Prof. Dr. -Ing. Krzysztof Rudion University of Stuttgart

 

Other publications of authors with the same name

Solving the resource-constrained project scheduling problem by a variable neighbourhood search., and . European Journal of Operational Research, 155 (2): 402-413 (2004)Algorithms for the unrelated parallel machine scheduling problem with a resource constraint., and . European Journal of Operational Research, 271 (3): 839-848 (2018)New algorithms for maximum disjoint paths based on tree-likeness., , and . Math. Program., 171 (1-2): 433-461 (2018)An enumerative heuristic and reduction methods for the assembly line balancing problem., and . European Journal of Operational Research, 145 (3): 606-620 (2003)Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem., and . Computers & OR, 36 (5): 1602-1607 (2009)Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts.. Computers & OR, 40 (1): 463-474 (2013)Minimum Rectilinear Polygons for Given Angle Sequences., , , , , and . JCDCGG, volume 9943 of Lecture Notes in Computer Science, page 105-119. Springer, (2015)A branch-and-bound algorithm for the quadratic multiple knapsack problem.. Eur. J. Oper. Res., 298 (1): 89-98 (2022)An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem.. INFORMS J. Comput., 28 (4): 703-720 (2016)A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem., and . Computers & Industrial Engineering, 47 (1): 91-101 (2004)