Dr. Krzysztof Fleszar

Assistant Professor
Warsaw University of Technology (WUT)
Faculty of Electronics & Information Technology (FEIT)
Institute of Control & Computation Engineering (ICCE)
ul. Nowowiejska 15/19
00-665 Warszawa, Poland

E-mail: kfleszar@ia.pw.edu.pl
Office: 561
Phone +48 22 6607123
Fax +48 22 8253719

Research Interests

  • Discrete Optimisation
  • Packing & Cutting Problems
  • Scheduling Problems

Published Articles in Refereed Journals

  1. Krzysztof Fleszar. Khalil S. Hindi. Fast, Effective Heuristics for the 0-1 Multidimensional Knapsack Problem. Computers & Operations Research. Accepted for Publication.
  2. Krzysztof Fleszar. Ibrahim H. Osman. Khalil S. Hindi. A variable neighbourhood search algorithm for the open vehicle routing problem. European Journal of Operational Research. In Press.
  3. Krzysztof Fleszar. Khalil S. Hindi. An Effective VNS for the Capacitated p-median Problem. European Journal of Operational Research. In Press.
  4. Krzysztof Fleszar. Khalil S. Hindi. Solving the Resource-Constrained Project Scheduling Problem by a Variable Neighbourhood Search. European Journal of Operational Research. Vol. 155. No. 2. 2004. p. 402-413
  5. Khalil S. Hindi. Krzysztof Fleszar. A Constraint Propagation Heuristic for Solving the Single-Hoist, Multiple-Products Scheduling Problem. Computers and Industrial Engineering. Vol. 47. 2004. p. 91-101
  6. Khalil S. Hindi. Krzysztof Fleszar. Christoforos Charalambous. An Effective Heuristic for the CLSP with Setup Times. Journal of Operational Research Society. Vol. 54. 2003. p. 490-498
  7. Krzysztof Fleszar. Khalil S. Hindi. An Enumerative Heuristic and Reduction Methods for the Assembly Line Balancing Problem. European Journal of Operational Research. Vol. 145. No. 3. 2003. p. 606-620
  8. Khalil S. Hindi. Hongbo Yang. Krzysztof Fleszar. An Evolutionary Algorithm for Resource-Constrained Project Scheduling. IEEE Transactions on Evolutionary Computation. Vol. 6. No. 5. 2002. p. 512-518
  9. Krzysztof Fleszar. Khalil S. Hindi. New Heuristics for One-Dimensional Bin-Packing. Computers and Operations Research. Vol. 29. No. 7. 2002. p. 821-839

Useful Links