Abdelkader Sbihi

Orcid: 0000-0002-5890-1667

Affiliations:
  • École de management de Normandie, France


According to our database1, Abdelkader Sbihi authored at least 16 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An improved genetic algorithm for the berth scheduling with ship-to-ship transshipment operations integrated model.
Comput. Oper. Res., January, 2024

2023
Logistics 4.0 for supply chain performance: perspectives from a retailing case study.
Bus. Process. Manag. J., 2023

2021
The operating behaviour of unbalanced, unpaced merging assembly lines.
RAIRO Oper. Res., 2021

2019
Efficient algorithms under dynamic graphs to solve the Capacitated Arc Routing Problem with feasible sparse graph.
RAIRO Oper. Res., 2019

2018
A genetic algorithm for the steel continuous casting with inter-sequence dependent setups and dedicated machines.
RAIRO Oper. Res., 2018

An Efficient Algorithm Based Tabu Search for the Robust Sparse CARP Under Travel Costs Uncertainty.
Proceedings of the Operations Research and Enterprise Systems, 2018

Capacitated Arc Routing Problem over Sparse Underlying Graph under Travel Costs Uncertainty.
Proceedings of the 7th International Conference on Operations Research and Enterprise Systems, 2018

On Some Smart Hybridized Heuristics and Local Search Programming.
Proceedings of the 7th International Conference on Operations Research and Enterprise Systems, 2018

2013
Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem.
J. Oper. Res. Soc., 2013

2010
A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem.
Eur. J. Oper. Res., 2010

Combinatorial optimization and Green Logistics.
Ann. Oper. Res., 2010

2007
A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem.
J. Comb. Optim., 2007

2006
A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem.
Comput. Optim. Appl., 2006

2004
Heuristic algorithms for the multiple-choice multidimensional knapsack problem.
J. Oper. Res. Soc., 2004

2003
Les Méthodes Hybrides en Optimisation Combinatoire :Algorithmes Exacts et Heuristiques. (The Hybrid Methods in Combinatorial Optimization: Exact Algorithms and Heuristics).
PhD thesis, 2003

2002
An Efficient Algorithm for the Knapsack Sharing Problem.
Comput. Optim. Appl., 2002


  Loading...