Combinatorial particle swarm optimization (CPSO) for partitional clustering problem. - Bassem Jarboui; Mohamed Cheikh; Patrick Siarry; Ahmed Riadh Rebai (Appl. Math. Comput., 2007)

A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. - Bassem Jarboui; N. Damak; Patrick Siarry; Ahmed Riadh Rebai (Appl. Math. Comput., 2008)

A combinatorial particle swarm optimisation for solving permutation flowshop problems. - Bassem Jarboui; Saber Ibrahim; Patrick Siarry; Abdelwaheb Rebaï (Comput. Ind. Eng., 2008)

Differential evolution for solving multi-mode resource-constrained project scheduling problems. - N. Damak; Bassem Jarboui; Patrick Siarry; Taïcir Loukil (Comput. Oper. Res., 2009)

An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. - Bassem Jarboui; Mansour Eddaly; Patrick Siarry (Comput. Oper. Res., 2009)

An Estimation of Distribution Algorithm for Flowshop Scheduling with Limited Buffers. - Mansour Eddaly; Bassem Jarboui; Patrick Siarry; Abdelwaheb Rebaï (Natural Intelligence for Scheduling, Planning and Packing Problems, 2009)

A new destructive bounding scheme for the bin packing problem. - Bassem Jarboui; Saber Ibrahim; Abdelwaheb Rebaï (Ann. Oper. Res., 2010)

A genetic algorithms to solve the bicriteria shortest path problem. - Mohamed Cheikh; Bassem Jarboui; Taïcir Loukil (Electron. Notes Discret. Math., 2010)

An Iterated Local Search for Solving A Location-Routing Problem. - Houda Derbel; Bassem Jarboui; Saïd Hanafi; Habib Chabchoub (Electron. Notes Discret. Math., 2010)

Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines. - Makram Zaidi; Bassem Jarboui; Imed Kacem; Taïcir Loukil (Electron. Notes Discret. Math., 2010)

A Hybrid Particle Swarm Optimization Algorithm for the Redundancy Allocation Problem. - Noura Beji; Bassem Jarboui; Mansour Eddaly; Habib Chabchoub (J. Comput. Sci., 2010)

A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times. - Radhouan Bouabda; Bassem Jarboui; Mansour Eddaly; Abdelwaheb Rebaï (Comput. Oper. Res., 2011)

A fuzzy logic control using a differential evolution algorithm aimed at modelling the financial market dynamics. - Nizar Hachicha; Bassem Jarboui; Patrick Siarry (Inf. Sci., 2011)

A GRASP based on DE to solve single machine scheduling problem with SDST. - Hanen Akrout; Bassem Jarboui; Patrick Siarry; Abdelwaheb Rebaï (Comput. Optim. Appl., 2012)

A variable neighborhood search for the multi-product inventory routing problem. - Anis Mjirda; Bassem Jarboui; Rita Macedo; Saïd Hanafi (Electron. Notes Discret. Math., 2012)

Genetic algorithm with iterated local search for solving a location-routing problem. - Houda Derbel; Bassem Jarboui; Saïd Hanafi; Habib Chabchoub (Expert Syst. Appl., 2012)

A differential evolution algorithm to solve redundancy allocation problems. - Noura Beji; Bassem Jarboui; Patrick Siarry; Habib Chabchoub (Int. Trans. Oper. Res., 2012)

Variable neighborhood search for location routing. - Bassem Jarboui; Houda Derbel; Saïd Hanafi; Nenad Mladenovic (Comput. Oper. Res., 2013)

The classroom assignment problem: Complexity, size reduction and heuristics. - Abdelkarim Elloumi; Hichem Kamoun; Bassem Jarboui; Abdelaziz Dammak (Appl. Soft Comput., 2014)

A two phase variable neighborhood search for the multi-product inventory routing problem. - Anis Mjirda; Bassem Jarboui; Rita Macedo; Saïd Hanafi; Nenad Mladenovic (Comput. Oper. Res., 2014)

Skewed general variable neighborhood search for the location routing scheduling problem. - Rita Macedo; Cláudio Alves; Saïd Hanafi; Bassem Jarboui; Nenad Mladenovic; Bruna Ramos; José M. Valério de Carvalho (Comput. Oper. Res., 2015)

A variable neighborhood search algorithm for the vehicle routing problem with multiple trips. - Mohamed Cheikh; Mustapha Ratli; Omar Mkaouar; Bassem Jarboui (Electron. Notes Discret. Math., 2015)

3rd International Conference on Variable Neighborhood Search (VNS'14). - Bassem Jarboui; Angelo Sifaleras; Abdelwaheb Rebaï (Electron. Notes Discret. Math., 2015)

A variable neighborhood search for solving the multi-vehicle covering tour problem. - Manel Kammoun; Houda Derbel; Mustapha Ratli; Bassem Jarboui (Electron. Notes Discret. Math., 2015)

0 - 1 Quadratic Knapsack Problem solved with VNS algorithm. - Said Toumi; Mohamed Cheikh; Bassem Jarboui (Electron. Notes Discret. Math., 2015)

Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem. - Mansour Eddaly; Bassem Jarboui; Patrick Siarry (J. Comput. Des. Eng., 2016)

Special issue on Variable neighborhood search methods in business and engineering. - Abraham Duarte; Nenad Mladenovic; Bassem Jarboui (Comput. Oper. Res., 2017)

A general variable neighborhood search for the swap-body vehicle routing problem. - Raca Todosijevic; Saïd Hanafi; Dragan Urosevic; Bassem Jarboui; Bernard Gendron (Comput. Oper. Res., 2017)

A variable neighborhood search algorithm for the capacitated vehicle routing problem. - Marwa Amous; Said Toumi; Bassem Jarboui; Mansour Eddaly (Electron. Notes Discret. Math., 2017)

New VNP for automatic programming. - Souhir Elleuch; Pierre Hansen; Bassem Jarboui; Nenad Mladenovic (Electron. Notes Discret. Math., 2017)

GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem. - Samia Hasni; Said Toumi; Bassem Jarboui; Anis Mjirda (Electron. Notes Discret. Math., 2017)

Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion. - Said Toumi; Bassem Jarboui; Mansour Eddaly; Abdelwaheb Rebaï (Int. J. Math. Oper. Res., 2017)

An integration of mixed VND and VNS: the case of the multivehicle covering tour problem. - Manel Kammoun; Houda Derbel; Mostapha Ratli; Bassem Jarboui (Int. Trans. Oper. Res., 2017)

Variable Neighborhood Programming For Evolving Discriminent Functions With Dynamic Thresholds. - Souhir Elleuch; Bassem Jarboui (ICMLC, 2018)

A Variable Neighborhood Search with Integer Programming for the Zero-One Multiple-Choice Knapsack Problem with Setup. - Yassine Adouani; Bassem Jarboui; Malek Masmoudi (ICVNS, 2018)

A General Variable Neighborhood Search with Mixed VND for the multi-Vehicle multi-Covering Tour Problem. - Manel Kammoun; Houda Derbel; Bassem Jarboui (ICVNS, 2018)

A GVNS Algorithm to Solve VRP with Optional Visits. - Manel Kammoun; Houda Derbel; Bassem Jarboui (ICVNS, 2018)

Two metaheuristics for solving no-wait operating room surgery scheduling problem under various resource constraints. - Manel Belkhamsa; Bassem Jarboui; Malek Masmoudi (Comput. Ind. Eng., 2018)

Hybrid Genetic Algorithm for Home Healthcare routing and scheduling problem. - Rahma Borchani; Malek Masmoudi; Bassem Jarboui (CoDIT, 2019)

A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem. - Houda Derbel; Bassem Jarboui; Rim Bhiri (Ann. Oper. Res., 2019)

Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem. - Noura Smiti; Mohamed Mahjoub Dhiaf; Bassem Jarboui; Saïd Hanafi (Int. Trans. Oper. Res., 2020)

Analysis of Six Different GP-Tree Neighborhood Structures. - Souhir Elleuch; Bassem Jarboui (ISDA, 2021)

Solving the joint production distribution problem by the variable neighbourhood search algorithm. - Nejah Ben Mabrouk; Bassem Jarboui; Mansour Eddaly (Int. J. Math. Oper. Res., 2021)

Variable neighborhood search algorithms for the permutation flowshop scheduling problem with the preventive maintenance. - Wahiba Jomaa; Mansour Eddaly; Bassem Jarboui (Oper. Res., 2021)

Big-means: Less is More for K-means Clustering. - Rustam Mussabayev; Nenad Mladenovic; Bassem Jarboui; Ravil Mussabayev (CoRR, 2022)

A matheuristic for the 0-1 generalized quadratic multiple knapsack problem. - Yassine Adouani; Bassem Jarboui; Malek Masmoudi (Optim. Lett., 2022)

Preventive maintenance planning of railway infrastructure by reduced variable neighborhood programming. - Souhir Elleuch; Bassem Jarboui; Nenad Mladenovic (Optim. Lett., 2022)

Variable neighborhood programming for symbolic regression. - Souhir Elleuch; Bassem Jarboui; Nenad Mladenovic; Jun Pei (Optim. Lett., 2022)

A General Variable Neighborhood Search approach based on a p-median model for cellular manufacturing problems. - Saber Ibrahim; Bassem Jarboui (Optim. Lett., 2022)

Mixed integer linear programming formulations for the permutation flow shop scheduling problem with preventive maintenance activities. - Wahiba Jomaa; Mansour Eddaly; Bassem Jarboui (Int. J. Math. Oper. Res., 2023)

How to Use K-means for Big Data Clustering? - Rustam Mussabayev; Nenad Mladenovic; Bassem Jarboui; Ravil Mussabayev (Pattern Recognit., 2023)

Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits. - Malek Masmoudi; Bassem Jarboui; Rahma Borchani (Optim. Lett., 2023)

Epsilon Oscillation Algorithm for the bi-objective green identical parallel machine scheduling problem. - Bassem Jarboui; Malek Masmoudi; Mansour Eddaly (Comput. Oper. Res., 2024)

A branch-and-bound approach to the no-idle flowshop scheduling problem. - Bassem Jarboui; Mansour Eddaly (Discret. Appl. Math., 2024)

Iterative integer linear programming-based heuristic for solving the multiple-choice knapsack problem with setups. - Yassine Adouani; Malek Masmoudi; Fethi Jarray; Bassem Jarboui (Expert Syst. Appl., 2024)

LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup. - Malek Masmoudi; Yassine Adouani; Bassem Jarboui (Int. Trans. Oper. Res., 2024)

Energy minimizing capacitated covering vehicle routing problem. - Milena Vukicevic; Mustapha Ratli; Atika Rivenq; Raca Todosijevic; Bassem Jarboui (Appl. Soft Comput., 2025)

Generalized variable neighborhood search algorithm for vehicle routing problem with time windows and synchronization. - Malek Masmoudi; Rahma Borchani; Bassem Jarboui (Comput. Oper. Res., 2025)