A MIP flow model for crop-rotation planning in a context of forest sustainable development L Alfandari, JL Lemalade, A Nagih, G Plateau Annals of Operations Research 190, 149-164, 2011 | 45 | 2011 |

Problèmes fractionnaires: tour d'horizon sur les applications et méthodes de résolution A Nagih, G Plateau RAIRO-Operations Research-Recherche Opérationnelle 33 (4), 383-419, 1999 | 43* | 1999 |

Tackling large-scale and combinatorial bi-level problems with a genetic programming hyper-heuristic E Kieffer, G Danoy, MR Brust, P Bouvry, A Nagih IEEE Transactions on Evolutionary Computation 24 (1), 44-56, 2019 | 35 | 2019 |

Lagrangean heuristics combined with reoptimization for the 0–1 bidimensional knapsack problem B Thiongane, A Nagih, G Plateau Discrete applied mathematics 154 (15), 2200-2211, 2006 | 32* | 2006 |

Reoptimization in Lagrangian methods for the 0–1 quadratic knapsack problem L Létocart, A Nagih, G Plateau Computers & operations research 39 (1), 12-18, 2012 | 30 | 2012 |

Nodal aggregation of resource constraints in a shortest path problem A Nagih, F Soumis European Journal of Operational Research 172 (2), 500-514, 2006 | 29 | 2006 |

Solutions diversification in a column generation algorithm N Touati, L Létocart, A Nagih Algorithmic Operations Research 5 (2), 86-95, 2010 | 23 | 2010 |

Combining arc-consistency and dual Lagrangean relaxation for filtering CSPs MOI Khemmoudj, H Bennaceur, A Nagih Integration of AI and OR Techniques in Constraint Programming for …, 2005 | 21 | 2005 |

Multi-period hub location problem with serial demands: A case study of humanitarian aids distribution in Lebanon RN Monemi, S Gelareh, A Nagih, N Maculan, K Danach Transportation Research Part E: Logistics and Transportation Review 149, 102201, 2021 | 19 | 2021 |

Hybrid mobility model with pheromones for UAV detection task E Kieffer, G Danoy, P Bouvry, A Nagih 2016 IEEE symposium series on computational intelligence (SSCI), 1-8, 2016 | 18 | 2016 |

Bi-objective load balancing multiple allocation hub location: a compromise programming approach RN Monemi, S Gelareh, A Nagih, D Jones Annals of Operations Research 296 (1), 363-406, 2021 | 17 | 2021 |

Bayesian optimization approach of general bi-level problems E Kieffer, G Danoy, P Bouvry, A Nagih Proceedings of the Genetic and Evolutionary Computation Conference Companion …, 2017 | 16 | 2017 |

0–1 Knapsack Problems G Plateau, A Nagih Paradigms of Combinatorial Optimization: Problems and New Approaches, 215-242, 2014 | 14 | 2014 |

Dantzig-Wolfe and Lagrangian decompositions in integer linear programming L Létocart, A Nagih, N Touati-Moungla International Journal of Mathematics in Operational Research 4 (3), 247-262, 2012 | 12 | 2012 |

An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual B Thiongane, A Nagih, G Plateau Annals of Operations Research 139, 353-373, 2005 | 12 | 2005 |

Hybrid column generation for large-size Covering Integer Programs: Application to transportation planning L Alfandari, J Sadki, A Plateau, A Nagih Computers & operations research 40 (8), 1938-1946, 2013 | 10 | 2013 |

An improving dynamic programming algorithm to solve the shortest path problem with time windows NT Moungla, L Létocart, A Nagih Electronic Notes in Discrete Mathematics 36, 931-938, 2010 | 10 | 2010 |

A Lagrangian Decomposition for 0-1 hyperbolic programming problems A Nagih, G Plateau International Journal of Mathematical Algorithms 1, 299-314, 2000 | 10 | 2000 |

A new co-evolutionary algorithm based on constraint decomposition E Kieffer, G Danoy, P Bouvry, A Nagih 2017 IEEE International Parallel and Distributed Processing Symposium …, 2017 | 9 | 2017 |

A partition algorithm for 0–1 unconstrained hyperbolic programs A Nagih, G Plateau Investigacion Operativa 9 (1–3), 167-178, 2000 | 9 | 2000 |