Narrow search
Showing 1 - 9 of 9
Cover Image
Efficient algorithms under dynamic graphs to solve the capacitated arc routing problem with feasible sparse graph
Tfaili, Sara; Dkhil, Hamdi; Sbihi, Abdelkader; Yassine, … - In: RAIRO / Operations research 53 (2019) 1, pp. 303-322
Persistent link: https://www.econbiz.de/10012113645
Cover Image
A hybrid beam search looking-ahead algorithm for the circular packing problem
Akeb, Hakim; Hifi, Mhand - In: Journal of combinatorial optimization 20 (2010) 2, pp. 101-130
Persistent link: https://www.econbiz.de/10008657931
Cover Image
Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem
Hifi, Mhand; Negre, Stéphane; Wu, Lei - In: International transactions in operational research : … 21 (2014) 1, pp. 59-79
Persistent link: https://www.econbiz.de/10010234038
Cover Image
A beam search algorithm for the circular packing problem
Akeb, Hakim; Hifi, Mhand; M'Hallah, Rym - In: Computers & operations research : and their … 36 (2009) 5, pp. 1513-1528
Persistent link: https://www.econbiz.de/10003827845
Cover Image
Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem
Aïder, Méziane; Gacem, Oussama; Hifi, Mhand - In: Journal of the Operational Research Society 73 (2022) 3, pp. 540-557
Persistent link: https://www.econbiz.de/10013170161
Cover Image
An iterative algorithm for the max-min knapsack problem with multiple scenarios
Al-douri, Thekra; Hifi, Mhand; Zissimopoulos, Vassilis - In: Operational research : an international journal 21 (2021) 2, pp. 1355-1392
Persistent link: https://www.econbiz.de/10012584208
Cover Image
Adaptive beam search lookahead algorithms for the circular packing problem
Akeb, Hakim; Hifi, Mhand; M'Hallah, Rym - In: International transactions in operational research : … 17 (2010) 5, pp. 553-575
Persistent link: https://www.econbiz.de/10008661889
Cover Image
A local search-based method for sphere packing problems
Hifi, Mhand; Yousef, Labib - In: European journal of operational research : EJOR 274 (2019) 2, pp. 482-500
Persistent link: https://www.econbiz.de/10011990130
Cover Image
A rounding strategy-based algorithm for the k-clustering minimum biclique completion problem
Hifi, Mhand; Sadeghsa, Shohre - In: Journal of the Operational Research Society 74 (2023) 1, pp. 258-271
Persistent link: https://www.econbiz.de/10014231717