| 2008 |
| 20 | EE | Hermann Bouly,
Duc-Cuong Dang,
Aziz Moukrim:
A Memetic Algorithm for the Team Orienteering Problem.
EvoWorkshops 2008: 649-658 |
| 19 | EE | François Clautiaux,
Antoine Jouglet,
Aziz Moukrim:
A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems.
WEA 2008: 43-54 |
| 18 | EE | Joseph El Hayek,
Aziz Moukrim,
Stéphane Nègre:
New resolution algorithm and pretreatments for the two-dimensional bin-packing problem.
Computers & OR 35(10): 3184-3201 (2008) |
| 17 | EE | François Clautiaux,
Antoine Jouglet,
Jacques Carlier,
Aziz Moukrim:
A new constraint programming approach for the orthogonal packing problem.
Computers & OR 35(3): 944-959 (2008) |
| 2007 |
| 16 | EE | Jacques Carlier,
François Clautiaux,
Aziz Moukrim:
New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation.
Computers & OR 34(8): 2223-2250 (2007) |
| 15 | EE | François Clautiaux,
Jacques Carlier,
Aziz Moukrim:
A new exact method for the two-dimensional orthogonal packing problem.
European Journal of Operational Research 183(3): 1196-1211 (2007) |
| 14 | EE | François Clautiaux,
Jacques Carlier,
Aziz Moukrim:
A new exact method for the two-dimensional bin-packing problem with fixed orientation.
Oper. Res. Lett. 35(3): 357-364 (2007) |
| 2006 |
| 13 | EE | Corinne Lucet,
Florence Mendes,
Aziz Moukrim:
An exact method for graph coloring.
Computers & OR 33: 2189-2207 (2006) |
| 2005 |
| 12 | EE | Aziz Moukrim,
Alain Quilliot:
Optimal preemptive scheduling on a fixed number of identical parallel machines.
Oper. Res. Lett. 33(2): 143-150 (2005) |
| 11 | EE | Marc Chardon,
Aziz Moukrim:
The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders.
SIAM J. Discrete Math. 19(1): 109-121 (2005) |
| 2004 |
| 10 | EE | Corinne Lucet,
Florence Mendes,
Aziz Moukrim:
Pre-processing and Linear-Decomposition Algorithm to Solve the k-Colorability Problem.
WEA 2004: 315-325 |
| 9 | EE | Frédéric Guinand,
Aziz Moukrim,
Eric Sanlaville:
Sensitivity analysis of tree scheduling on two machines with communication delays.
Parallel Computing 30(1): 103-120 (2004) |
| 2003 |
| 8 | EE | François Clautiaux,
Jacques Carlier,
Aziz Moukrim,
Stéphane Nègre:
New Lower and Upper Bounds for Graph Treewidth.
WEA 2003: 70-80 |
| 7 | EE | Aziz Moukrim:
Scheduling Unitary Task Systems with Zero-one Communication Delays for Quasi-interval Orders.
Discrete Applied Mathematics 127(3): 461-476 (2003) |
| 2001 |
| 6 | | Marc Chardon,
Aziz Moukrim:
Optimal Schedules of Coffman-Graham Algorithm for a New Order Class.
IPDPS 2001: 138 |
| 1999 |
| 5 | EE | Aziz Moukrim,
Eric Sanlaville,
Frédéric Guinand:
Scheduling with Communication Delays and On-Line Disturbances.
Euro-Par 1999: 350-357 |
| 4 | EE | Aziz Moukrim:
Non-preemptive Profile Scheduling and Quasi Interval Orders.
Electronic Notes in Discrete Mathematics 3: 133-139 (1999) |
| 3 | EE | Aziz Moukrim:
Optimal scheduling on parallel machines for a new order class.
Oper. Res. Lett. 24(1-2): 91-95 (1999) |
| 1998 |
| 2 | | Aziz Moukrim,
Alain Quilliot:
Scheduling with Communication Delays and Data Routing in Message Passing Architectures.
IPPS/SPDP Workshops 1998: 438-451 |
| 1 | EE | Jonas Koko,
Aziz Moukrim:
Parallel Implementation of a Generalized Conjugate Gradient Algorithm.
Informatica, Lith. Acad. Sci. 9(4): 437-448 (1998) |