https://www.hds.utc.fr/~moukrim/dokuwiki/ 2026-05-13T16:32:00+00:00 https://www.hds.utc.fr/~moukrim/dokuwiki/ https://www.hds.utc.fr/~moukrim/dokuwiki/_media/wiki/dokuwiki.svg text/html 2007-06-08T08:54:09+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.hds.utc.fr/~moukrim/dokuwiki/en/events?rev=1181292849&do=diff EVENTS * Journée Industrielle en Ordonnancement, Transport et Logistique * MAPSP01 * Appel à contributions (ouvrage Hermès) Flexibilité et Robustesse en Ordonnancement text/html 2012-08-10T02:00:25+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.hds.utc.fr/~moukrim/dokuwiki/en/mcp?rev=1344564025&do=diff The Maximum Clique Problem Short description The Maximum Clique Problem (MCP) on a graph involves finding the largest set of vertices, any two of which are adjacent. The MCP is generally NP-Hard and equivalent to the Maximum Independent Set Problem (MISP) and the Minimum Vertex Cover Problem (MVCP). text/html 2013-09-21T21:28:00+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.hds.utc.fr/~moukrim/dokuwiki/en/mscp?rev=1379798880&do=diff Upper and Lower Bounds for the Minimum Sum Coloring Problem Description In this work, we study upper and lower bounds of the Minimum Sum Coloring Problem (MSCP) from a uniform point of view. MSCP is a graph coloring problem whose goal is to minimize the sum of colors, where colors are represented by natural numbers. We propose calculating upper and lower bounds for MSCP using a single coloring algorithm: a Memetic Algorithm (MA) hybridizing a simple genetic algorithm with local search. Our low… text/html 2007-06-08T09:05:36+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.hds.utc.fr/~moukrim/dokuwiki/en/ouvrage?rev=1181293536&do=diff APPEL A CONTRIBUTIONS (Ouvrage Hermès) Flexibilité et Robustesse en Ordonnancement L'éditeur Hermès a donné son accord pour la publication d'un livre sur le thème : Flexibilité et Robustesse en Ordonnancement. La rédaction de cet ouvrage est coordonnée par Jean-Charles Billaut, Aziz Moukrim et Eric Sanlaville, dans le cadre du projet du même nom de l' text/html 2007-02-08T08:40:03+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.hds.utc.fr/~moukrim/dokuwiki/en/publi?rev=1170924003&do=diff <phpinc=publications_en.php> text/html 2018-03-06T10:28:04+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.hds.utc.fr/~moukrim/dokuwiki/en/publis_hal?rev=1520332084&do=diff text/html 2012-07-13T17:17:24+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.hds.utc.fr/~moukrim/dokuwiki/en/research?rev=1342199844&do=diff Vehicle Routing Problem * Team Orienteering Problem * Team Orienteering Problem with Time Windows * Vehicle Routing Problem with Time Windows and Synchronization Algorithmics in Graph Theory * Minimum Sum Coloring Problem * Maximum Clique Problem text/html 2023-08-17T14:10:19+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.hds.utc.fr/~moukrim/dokuwiki/en/sidebar?rev=1692281419&do=diff Welcome page Research Publications Teaching text/html 2020-02-05T09:36:53+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.hds.utc.fr/~moukrim/dokuwiki/en/start?rev=1580895413&do=diff Aziz MOUKRIM Professeur en Informatique à l'Université de Technologie de Compiègne (UTC) Adresse HeuDiaSyC (UMR CNRS 7253) Université de Technologie de Compiègne Génie Informatique 57 avenue de Landshut 60200 COMPIEGNE Tel: 33 03 44 23 49 52 Fax: 33 03 44 23 44 77 text/html 2007-06-08T09:11:33+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.hds.utc.fr/~moukrim/dokuwiki/en/teaching?rev=1181293893&do=diff Teaching (2000 - 2003) * Filière ADEL (Aide à la Décision En Logistique (UTC) * Simulation et méthodes avancées d'optimisation (RO06, UTC) * Algorithmique et structures de données (NF16, UTC) * Optimisation combinatoire (DEA contrôle industriel, Faculté de Génie de l'Université Libanaise, Beyrouth) * Méthodes de programmation ou quelques concepts d'ingénierie logicielle (LO11, UTC) * text/html 2013-03-01T11:46:08+00:00 Anonymous (anonymous@undisclosed.example.com) https://www.hds.utc.fr/~moukrim/dokuwiki/en/top?rev=1362138368&do=diff The Team Orienteering Problem Description The Team Orienteering Problem (TOP) [2] comes from an outdoor game played in mountainous or forested areas. In this game a team of several players tries to collect as many reward points as possible within a given time limit. Similarly, TOP is the problem where a limited number of vehicles are available to visit customers from a potential set, the travel time of each vehicle being limited by a time quota, customers having different corresponding profits…