Tuesday : 9:30 AM - 11:00 AM
Tuesday : 2:00 PM - 3:00 PM
Thursday : 9:30 AM - 11:00 AM
Thursday : 2:00 PM - 3:00 PM

January  2005
Warsaw University of Technology
Warsaw,  Poland.
Ph.D. in Informatics

October  2001
Warsaw University of Technology
Warsaw,  Poland.
MS in Informatics

Peer-Reviewed Journal Articles

1. Fleszar, K and Hindi, K  (2009)  'Fast, Effective Heuristics for the 0-1 Multidimensional Knapsack Problem',  Computers & Operations Research , 36:5, 1602-1607

2. Fleszar, K, Osman, I and Hindi, K  (2009)  'A variable neighbourhood search algorithm for the open vehicle routing problem',  European Journal of Operational Research , 195:3, 803-809

3. Fleszar, K and Hindi, K  (2008)  'An Effective VNS for the Capacitated p-median Problem',  European Journal of Operational Research , 191:3, 612-622

4. Fleszar, K and Hindi, KS  (2004)  'Solving the Resource-Constrained Project Scheduling Problem by a Variable Neighbourhood Search',  European Journal of Operational Research , 155:2, 402-413

5. Hindi, KS and Fleszar, K  (2004)  'A Constraint Propagation Heuristic for Solving the Single-Hoist, Multiple-Products Scheduling Problem',  Computers and Industrial Engineering , 47, 91-101

6. Hindi, KS, Fleszar, K and Charalambous, C  (2003)  'An Effective Heuristic for the CLSP with Setup Times',  Journal of Operational Research Society , 54, 490-498

7. Fleszar, K and Hindi, KS  (2003)  'An Enumerative Heuristic and Reduction Methods for the Assembly Line Balancing Problem',  European Journal of Operational Research , 145:3, 606-620

8. Hindi, KS, Yang, H and Fleszar, K  (2002)  'An Evolutionary Algorithm for Resource-Constrained Project Scheduling',  IEEE Transactions on Evolutionary Computation , 6:5, 512-518

9. Fleszar, K and Hindi, KS  (2002)  'New Heuristics for One-Dimensional Bin-Packing',  Computers and Operations Research , 29:7, 821-839