Details about Abdelkader Sbihi
| E-mail: |
|
| Phone: | Tél: (+33) 1 44 07 83 07 |
| Postal address: | Université Paris 1 Panthéon-Sorbonne Maison des Sciences Economiques Laboratoire CERMSEM UMR-CNRS 8095 106-112 Boulevard de l'Hôpital 75647 Paris Cedex 13, France. |
| Workplace: | Centre de recherche de mathématiques et économie mathématique (CERMSEM) (Center for Research in Mathematics and Mathematical Economics), Centre d'Économie de la Sorbonne (Sorbonne Economic Centre), Université Paris 1 (Panthéon-Sorbonne) (University of Paris 1), (more information at EDIRC)
|
Access statistics for papers by Abdelkader Sbihi.
Last updated 2016-03-18. Update your information in the RePEc Author Service.
Short-id: psb2
Jump to Journal Articles
Working Papers
2010
- Combinatorial optimization and Green Logistics
Post-Print, HAL  View citations (69)
See also Journal Article Combinatorial optimization and Green Logistics, Annals of Operations Research, Springer (2010) View citations (45) (2010)
2009
- A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem
Post-Print, HAL
See also Journal Article A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem, European Journal of Operational Research, Elsevier (2010) View citations (4) (2010)
2007
- The Relationship between Vehicle Routing & Scheduling and Green Logistics - A Literature Survey
Working Papers, HAL View citations (6)
2000
- Efficient Algorithms for the Knapsack Sharing Problem
Papiers d'Economie Mathématique et Applications, Université Panthéon-Sorbonne (Paris 1) View citations (2)
Journal Articles
2013
- Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem
Journal of the Operational Research Society, 2013, 64, (10), 1461-1473
2010
- A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem
European Journal of Operational Research, 2010, 202, (2), 339-346 View citations (4)
See also Working Paper A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem, Post-Print (2009) (2009)
- Combinatorial optimization and Green Logistics
Annals of Operations Research, 2010, 175, (1), 159-175 View citations (45)
See also Working Paper Combinatorial optimization and Green Logistics, Post-Print (2010) View citations (69) (2010)
|
The links between different versions of a paper are constructed automatically by matching on the titles.
Please contact if a link is incorrect.
Use this form
to add links between versions where the titles do not match.
|
EconPapers is hosted by the
School of Business at Örebro University.