The following pages link to Bassem Jarboui (Q337228):
Displayed 37 items.
- A two phase variable neighborhood search for the multi-product inventory routing problem (Q337230) (← links)
- Skewed general variable neighborhood search for the location routing scheduling problem (Q337608) (← links)
- Variable neighborhood search for location routing (Q339539) (← links)
- A GRASP based on DE to solve single machine scheduling problem with SDST (Q434179) (← links)
- A new destructive bounding scheme for the bin packing problem (Q610978) (← links)
- A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times (Q709158) (← links)
- (Q990530) (redirect page) (← links)
- Combinatorial particle swarm optimization (CPSO) for partitional clustering problem (Q990533) (← links)
- An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems (Q1010274) (← links)
- Differential evolution for solving multi-mode resource-constrained project scheduling problems (Q1010277) (← links)
- A general variable neighborhood search for the swap-body vehicle routing problem (Q1652113) (← links)
- GVNS based heuristic for solving the multi-product multi-vehicle inventory routing problem (Q1687640) (← links)
- New VNP for automatic programming (Q1687679) (← links)
- A variable neighborhood search algorithm for the capacitated vehicle routing problem (Q1687688) (← links)
- A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem (Q1730626) (← links)
- A matheuristic for the 0--1 generalized quadratic multiple knapsack problem (Q2070116) (← links)
- A general variable neighborhood search approach based on a \(p\)-median model for cellular manufacturing problems (Q2070119) (← links)
- Variable neighborhood programming for symbolic regression (Q2070125) (← links)
- Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion (Q2204271) (← links)
- A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems (Q2467429) (← links)
- 0-1 quadratic knapsack problem solved with VNS algorithm (Q2631284) (← links)
- A variable neighborhood search algorithm for the vehicle routing problem with multiple trips (Q2631286) (← links)
- A variable neighborhood search for solving the multi-vehicle covering tour problem (Q2631288) (← links)
- Solving the joint production distribution problem by the variable neighbourhood search algorithm (Q2664627) (← links)
- A variable neighborhood search for the multi-product inventory routing problem (Q2840757) (← links)
- (Q2861505) (← links)
- Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines (Q2883611) (← links)
- (Q3016414) (← links)
- A differential evolution algorithm to solve redundancy allocation problems (Q4929092) (← links)
- Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times (Q4987698) (← links)
- Variable Neighborhood Programming as a Tool of Machine Learning (Q5153506) (← links)
- An integration of mixed VND and VNS: the case of the multivehicle covering tour problem (Q5278232) (← links)
- A general variable neighbourhood search for the multi-product inventory routing problem (Q5382677) (← links)
- Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits (Q6063509) (← links)
- Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem (Q6066728) (← links)
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup (Q6146649) (← links)
- A branch-and-bound approach to the no-idle flowshop scheduling problem (Q6202953) (← links)