Go to: Belhaiza, S. Website


Teaching Assignment and Office Hours

Name: Dr.Belhaiza, S. Phone: 1054 Off. Loc: 5-203/2 Email: slimb@kfupm.edu.sa

 

Teaching assignment
# Course Section Period Location Activity Days

 

Office Hours (Phone: Office: )
Sunday Monday Tuesday Wednesday Thursday
 11:00-11:50
 
 
 
 11:00-11:50
 
 
 
 11:00-11:50
 
Remark:


Publications

Sno Publications Year Status
[1] S. Belhaiza, "A Game Theoretic Approach for the Real-Life Vehicle Routing Problem with Multiple Time Windows," IEEE Systems Journal, vol. 12, no. 2, pp. 1251-1262, June 2018. 2018 Published
[2] HS Ferreira, ET Bogue, TF Noronha, S Belhaiza, and C Prins, "Variable Neighborhood Search for Vehicle Routing Problem with Multiple Time Windows," Discrete Mathematics, vol. 66, pp. 207-214, 2018. 2018 Published
[3] Belhaiza, S., Charrad, S., and M'Hallah, R., "On the Performance of Managers and Controllers: A Polymatrix Game Approach for the Manager–Controller–Board of Directors’ Conflict," Journal of Optimization Theory and Applications, 2018. 2018 Published
[4] Belhaiza, S., M Hallah R., and Ben Brahim G., "A New Hybrid Genetic Variable Neighborhood Search Heuristic for the Vehicle Routing Problem with Multiple Time Windows," IEEE World Congress on Computational Intelligence, pp. 1319-1326, June 2017. 2017 Published
[5] S. Belhaiza and M Hallah R., "A Pareto Non-Dominated Solution Approach for the Vehicle Routing Problems with Multiple Time Windows," IEEE World Congress on Computational Intelligence, pp. 3515-3524, July 2016. 2016 Published
[6] S. Belhaiza and Uthman Baroudi, "A Game Theoretic Model for Smart Grids Demand Management," IEEE Transactions on Smart Grid, no. 6,3, pp. 1386-1393, 2015. 2015 Published
[7] Belhaiza, S., Hansen, P., and Laporte, G., "Hybrid Variable Neighborhood Tabu Search Heuristic for the Vehicle Routing Problem with Multiple Time Windows," Computers & Operations Research, vol. 52, pp. 269-281, Sep. 2014. 2014 Published
[8] Belhaiza, S., Audet, C., and Hansen, P., "A Note on Bimatrix Game Maximal Selten Subsets," Arabian Journal of Mathematics, 2014.   2014 Published
[9] S. Belhaiza, "On Perfect Nash Equilibria of Polymatrix Games," Game Theory, pp. 1-11, 2014.   2014 Published
[10] Slim Belhaiza, Charles Audet, and Pierre Hansen, "On proper refinement of Nash equilibria for bimatrix games," Automatica, vol. 48, no. 2, pp. 297-303, Feb. 2012.   2012 Published
[11] Slim Belhaiza, Charles Audet, and Pierre Hansen, "A New Sequence form approach for the enumeration of all extreme Nash equilibria for Extensive form Games," International Game Theory Review, vol. 11, no. 4, Dec. 2009.   2009 Published
[12] Slim Belhaiza, Charles Audet, and Pierre Hansen, "Enumeration of all extreme Nash equilibria in Game theory: Bimatrix and Polymatrix Games," Journal of Optimization Theory and Applications, vol. 129, no. 3, pp. 349-372, June 2006.   2006 Published
[13] Slim Belhaiza, Nair Maria Maia de ABREU, Pierre Hansen, and Carla Silva OLIVEIRA, "Variable neighborhood search for extremal graphs XI. Bounds on algebraic connectivity.," in Graph Theory and Combinatorial Optimization, David Avis, Alain Hertz and Odile Marcotte, Ed. Springer US, 2005, pp. 16.   2005 Published


Projects

# Title PI/Coordinaor Members Sponsor Grant Ref # S-Date E-Date Month Status


Course Files

Course Section Semester F1,F2.. :Final Exams, E1,E2..:Majors Q1,.. :Quizzes H1,.. : Homework& S1,.: Syllabus
MATH101 02 183
MATH101 04 183
MATH102 36 182
MATH102 37 182
MATH590 01 182
MATH102 13 181
MATH102 15 181
MATH102 17 181
MATH102 10 172 Q1 Q2
STAT361 01 172 F1 E1 E2 Q1 H1 H2 H3 O1 O2 O3 O4
MATH102 01 171 E1 E2 F1
MATH102 09 162 Q1 Q2
MATH102 36 162 Q1 Q2
MATH101 20 161 Q1 Q2 Q3 Q4 Q5
(See section: 29 )
MATH101 29 161 Q1 Q2 Q3 Q4 Q5
(See section: 20 )
MATH101 07 152 Q1 Q2 Q3 Q4
STAT361 01 152 E1 F1 E2 H1 H2 Q1 S1
MATH101 13 151 E1 E2 F1 Q1 Q2 Q3 Q4 Q5 S1
(See section: 21 )
MATH101 21 151 F1 E1 E2 Q4 S1
(See section: 13 )
MATH592 01 142 F1 E1 H1 H2 H3 H4 S1
STAT361 01 142 F1 E1 H1 H2 H3 S1
MATH592 01 132 S1 F1 E1 E2 E3
STAT361 01 132 S1 F1 E1 E2 H1
MATH101 12 131 F1 E1
MATH101 21 131
(See section: 12 )
MATH102 05 123 S1 E1 E2 F1 E3
MATH102 06 123
(See section: 05 )
MATH101 03 122 S1 E2 F1 F2
MATH101 04 122
(See section: 03 )
MATH101 12 121 E1 E2 S1 F1
MATH101 21 121
(See section: 12 )
MATH101 08 112
MATH201 02 112
MATH201 03 112
MATH101 08 111
MATH480 01 111
MATH260 03 102 S1 F1 E1 E2
MATH260 04 102
(See section: 03 )
MATH202 05 101 E2 E1 Q1 S1 F1
MATH480 01 101 F1 E1 E2 S1 O1 O2 O3 O4
MATH202 03 092 E1 E2 O1 S1
MATH202 06 092 E1 E3 O1 S1
(See section: 03 )
MATH202 10 092 E1 E2 O1 S1
(See section: 03 )
MATH202 03 091 F1 E1 E2 S1
MATH202 07 091 F1 E1 E2 S1
(See section: 03 )


Teachnical Reports

# Title View

[Last Update: 11/12/2019]