2009 |
10 | EE | Krzysztof Fleszar,
Khalil S. Hindi:
Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem.
Computers & OR 36(5): 1602-1607 (2009) |
9 | EE | Krzysztof Fleszar,
Ibrahim H. Osman,
Khalil S. Hindi:
A variable neighbourhood search algorithm for the open vehicle routing problem.
European Journal of Operational Research 195(3): 803-809 (2009) |
2008 |
8 | EE | Mohammad Mahdavi Mazdeh,
Mansoor Sarhadi,
Khalil S. Hindi:
A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times.
Computers & OR 35(4): 1099-1111 (2008) |
7 | EE | Krzysztof Fleszar,
Khalil S. Hindi:
An effective VNS for the capacitated p-median problem.
European Journal of Operational Research 191(3): 612-622 (2008) |
2007 |
6 | EE | Mohammad Mahdavi Mazdeh,
Mansoor Sarhadi,
Khalil S. Hindi:
A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs.
European Journal of Operational Research 183(1): 74-86 (2007) |
2004 |
5 | EE | Krzysztof Fleszar,
Khalil S. Hindi:
Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
European Journal of Operational Research 155(2): 402-413 (2004) |
2003 |
4 | EE | Krzysztof Fleszar,
Khalil S. Hindi:
An enumerative heuristic and reduction methods for the assembly line balancing problem.
European Journal of Operational Research 145(3): 606-620 (2003) |
2002 |
3 | EE | Krzysztof Fleszar,
Khalil S. Hindi:
New heuristics for one-dimensional bin-packing.
Computers & OR 29(7): 821-839 (2002) |
2 | | Khalil S. Hindi,
Hongbo Yang,
Krzysztof Fleszar:
An evolutionary algorithm for resource-constrained project scheduling.
IEEE Trans. Evolutionary Computation 6(5): 512-518 (2002) |
2001 |
1 | EE | Cüneyt F. Bazlamaçci,
Khalil S. Hindi:
Minimum-weight spanning tree algorithms A survey and empirical study.
Computers & OR 28(8): 767-785 (2001) |