MAORE: Méthodes Algorithmes pour l'Ordonnancement et les Réseaux

Les membres de l'équipe MAORE utilisent les outils de l'optimisation combinatoire, de la théorie des graphes, de la programmation mathématique et de la programmation par contrainte pour résoudre des problèmes d'optimisation discrets de manière exacte ou approchée. Les principaux domaines d'application sont les réseaux et l'ordonnancement. Notre analyse porte sur la complexité, l'approximation et la robustesse. Nous nous intéressons aussi bien aux propriétés théoriques des algorithmes proposés pour ces problèmes qu'à leur efficacité numérique sur des instances réelles. Ces domaines applicatifs nous conduisent à collaborer avec des chercheurs de divers domaines (micro-électronique, robotique, bio-informatique, génie logiciel, ...).

Membres

Permanents

Non permanents

Collaborateurs réguliers

  • Benoit Darties, Maître de Conférences

Thématiques de recherche

Publications depuis 2013 - Evaluation 2019

Articles de revues internationales

2016

  1. Branch-and-price algorithms for the solution of the Multi-Trip Vehicle Routing Problem with Time Windows
    Florent Hernandez, Dominique Feillet, Rodolphe Giroudeau, Olivier Naud
    European Journal of Operational Research, Elsevier, 2016, 249 (2), pp.551-559.
  2. Partial target coverage to extend the lifetime in wireless multi-role sensor networks
    Fabian Castaño, Eric Bourreau, André Rossi, Marc Sevaux, Nubia Velsaco
    Networks, Wiley, 2016, 68 (1), pp.34-53.
  3. Decomposition for adjustable robust linear optimization subject to uncertainty polytope
    Josette Ayoub, Michael Poss
    Computational Management Science, Springer Verlag, 2016, 13 (2), pp.219-239.
  4. Some complexity and approximation results for coupled-tasks scheduling problem according to topology
    Benoit Darties, Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin
    RAIRO - Operations Research, EDP Sciences, 2016, 50, pp.781-795.

2015

  1. Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks
    Fabian Castaño, Eric Bourreau, Nubia Velasco, André Rossi, Marc Sevaux
    European Journal of Operational Research, Elsevier, 2015, 241 (1), pp.28-38.
  2. Exact approaches for scaffolding
    Mathias Weller, Annie Château, Rodolphe Giroudeau
    BMC Bioinformatics, BioMed Central, 2015, pp.S2.
  3. Generalized Elastic Flow Rerouting Scheme
    Yoann Fouquet, Dritan Nace, Michal Pioro, Michael Poss, Mateusz Zotkiewicz
    Networks, Wiley, 2015, 66 (4), pp.267-281.
  4. Leveraging Light Forest With Rateless Network Coding to Design Efficient All-Optical Multicast Schemes for Elastic Optical Networks
    Lulu Yang, Long Gong, Fen Zhou, Bernard Cousin, Miklós Molnár, Zuqing Zhu
    Journal of Lightwave Technology, Institute of Electrical and Electronics Engineers (IEEE)/Optical Society of America(OSA), 2015, 33 (18), pp.3945-3955.
  5. Robust constrained shortest path problems under budgeted uncertainty
    Artur Alves Pessoa, Luigi Di Puglia Pugliese, Francesca Guerriero, Michael Poss
    Networks, Wiley, 2015, 66 (2), pp.98-111.
  6. Minimizing Blocking Probability for the Multicast Routing and Wavelength Assignment Problem in WDM Networks: Exact Solutions and Heuristic Algorithms
    Dinh Danh Le, Feng Zhou, Miklós Molnár
    Journal of optical communications and networking, Piscataway, NJ ; Washington, DC : IEEE : Optical Society of America, 2015, 7 (1), pp.36-48.
  7. Guest Editorial to the Feature Cluster "EURO/INFORMS 2013 Conference
    Marc Sevaux, Kenneth Sörensen, Eric Bourreau
    European Journal of Operational Research, Elsevier, 2015, 244 (1), pp.1-2.
  8. Improved approximation algorithms for scheduling parallel jobs on identical clusters
    Marin Bougeret, Pierre-Francois Dutot, Denis Trystram, Klaus Jansen, Christina Robenek
    no abstract. Theoretical Computer Science, Elsevier, 2015, 600, pp.70--85.

2014

  1. Cooperative localization techniques for wireless sensor networks: free, signal and angle based techniques
    Abderrahim Benslimane, Clément Saad, Jean-Claude König, Mohammed Boulmalf
    Wireless Communications and Mobile Computing, Wiley, 2014, 14 (17), pp.1627-1646.
  2. A comparison of routing sets for robust network design
    Michael Poss
    Optimization Letters, Springer Verlag, 2014, 8 (5), pp.1619-1635.
  3. Robust combinatorial optimization with variable cost uncertainty
    Michael Poss
    European Journal of Operational Research, Elsevier, 2014, 237 (3), pp.836-845.

2013

  1. Moderately exponential approximation for makespan minimization on related machines
    Marin Bougeret, Pierre-Francois Dutot, Denis Trystram
    Theoretical Computer Science, Elsevier, 2013, In press. <10.1016/j.tcs.2013.03.020>
  2. Exact solution for branch vertices constrained spanning problems
    Massinissa Merabet, Sylvain Durand, Miklós Molnár
    Electronic Notes in Discrete Mathematics, Elsevier, 2013, 41 (5), pp.527-534.

2012

  1. Disruption Management for Commercial Airlines: Methods and results for the ROADEF 2009 Challenge
    Christian Artigues, Eric Bourreau, Hasan-Murat Afsar, Olivier Briant, Mourad Boudia
    European Journal of Industrial Engineering, Inderscience, 2012, 6 (6), pp.669-689.

2011

  1. Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
    Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram
    Discrete Mathematics, Algorithms and Applications, World Scientific Publishing, 2011, 3 (4), pp.553-586.
  2. Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor
    Gilles Simonin, Benoit Darties, Rodolphe Giroudeau, Jean-Claude König
    Journal of Scheduling, Springer Verlag, 2011, 14 (5), pp.501-509.
  3. 2018

    1. A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
      Sara Mattia, Michael Poss
      Computational Optimization and Applications, Springer Verlag, 2018, 69 (3), pp.753 - 800.
    2. ILP formulation of the exact solution of multi-constrained minimum cost multicast
      Walid Khallef, Sylvain Durand, Miklós Molnár
      Computer Networks, Elsevier, 2018, 135, pp.160-170.
    3. Integer programming formulations for three sequential discrete competitive location problems with foresight
      José Gentile, Artur Alves Pessoa, Michael Poss, Marcos Costa Roboredo
      European Journal of Operational Research, Elsevier, 2018, 265 (3), pp.872-881.
    4. Path Generation for Affine Flow Thinning
      Michał Pióro, Ilya Kalesnikau, Michael Poss
      Electronic Notes in Discrete Mathematics, Elsevier, 2018, 64, pp.355 - 364.
    5. Minimizing the weighted sum of completion times under processing time uncertainty
      Zacharie Ales, Thi Sang Nguyen, Michael Poss
      Electronic Notes in Discrete Mathematics, Elsevier, 2018, 64, pp.15 - 24.
    6. Robust combinatorial optimization with knapsack uncertainty
      Michael Poss
      Discrete Optimization, Elsevier, 2018, 27, pp.88 - 102.
    7. k -Adaptive Routing for the Robust Network Loading Problem
      Marco Silva, Michael Poss, Nelson Maculan
      Electronic Notes in Discrete Mathematics, Elsevier, 2018, 64, pp.95 - 104.
    8. An Energy-Efficient Multiobjective Scheduling Model for Monitoring in Internet of Things
      Basma Mostafa, Abderrahim Benslimane, Mohamed Saleh, Sally Kassem, Miklós Molnár
      IEEE internet of things journal, IEEE, 2018, 5 (3), pp.1727-1738.

    2017

    1. ILP formulation of the degree-constrained minimum spanning hierarchy problem
      Massinissa Merabet, Miklós Molnár, Sylvain Durand
      Journal of Combinatorial Optimization, Springer Verlag, 2017, pp.1-23.
    2. An optimization framework for traffic restoration in optical wireless networks with partial link failures
      Yoann Fouquet, Dritan Nace, Michal Pioro, Michael Poss
      Optical Switching and Networking, Elsevier, 2017, Design and modeling of Resilient optical networks RNDM 2015, 23 (2), pp.108-117.

    2016

    1. A dynamic programming approach for a class of robust optimization problems
      Marcio Costa Santos, Agostinho Agra, Michael Poss, Dritan Nace
      SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2016, 26 (3), pp.1799-1823.
    2. Exact Algorithm to Solve the Minimum Cost Multi-Constrained Multicast Routing Problem
      Miklós Molnár
      Journal of Computer and Communications, SCIRP, 2016, Special Issue on Routing Research, 4 (14), pp.57-79.
    3. On the complexity of Wafer-to-Wafer Integration
      Marin Bougeret, Vincent Boudet, Trivikram Dokka, Guillerme Duvillié, Rodolphe Giroudeau
      Discrete Optimization, Elsevier, 2016, 22 (part B), pp.255-269.
    4. MeDrone: On the use of a medical drone to heal a sensor network infected by a malicious epidemic
      Nicola Zema, Enrico Natalizio, Michael Poss, Giuseppe Ruggeri, Antonella Molinaro
      Ad Hoc Networks, Elsevier, 2016, 50, pp.115-127.
    5. Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations
      Rodolphe Giroudeau, Guillerme Duvillié, Marin Bougeret, Rémi Watrigant
      Discrete Mathematics and Theoretical Computer Science, DMTCS, 2016, In press.
    6. Machine reassignment problem: the ROADEF/EURO challenge 2012
      Hasan-Murat Afsar, Christian Artigues, Eric Bourreau, Safia Kedad-Sidhoum
      Annals of Operations Research, Springer Verlag, 2016, 242 (1), pp.1-17.
    7. Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity
      Michal Pioro, Yoann Fouquet, Dritan Nace, Michael Poss
      Operations Research, INFORMS, 2016, 64 (2), pp.273-289.
    8. Approximating the sparsest $k$-subgraph in chordal graph
      Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau
      Theory of Computing Systems, Springer Verlag, 2016, 58 (1), pp.111-132.

    2015

    1. Cautious label ranking with label-wise decomposition
      Sebastien Destercke, Marie-Hélène Masson, Michael Poss
      European Journal of Operational Research, Elsevier, 2015, 246 (3), pp.927-935.
    2. Robust network design with uncertain outsourcing cost
      Artur Alves Pessoa, Michael Poss
      INFORMS Journal on Computing, Institute for Operations Research and the Management Sciences (INFORMS), 2015. <10.1287/ijoc.2015.0643>
    3. A complexity and approximation framework for the maximization scaffolding problem
      Annie Château, Rodolphe Giroudeau
      Theoretical Computer Science, Elsevier, 2015, 595, pp.92-106.

    2014

    1. A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration
      Rodolphe Giroudeau, Dominique Feillet, Florent Hernandez, Olivier Naud
      4OR: A Quarterly Journal of Operations Research, Springer Verlag, 2014, 12 (3), pp.235-259.
    2. Multicast routing in WDM networks without splitters
      Dinh Danh Le, Miklós Molnár, Jérôme Palaysi
      IEEE Communications Magazine, Institute of Electrical and Electronics Engineers, 2014, 52 (7), pp.158-167.
    3. Using group replication for resilience on exascale systems
      Marin Bougeret, Henri Casanova, Yves Robert, Frédéric Vivien, Dounia Zaidouni
      International Journal of High Performance Computing Applications, SAGE Publications, 2014, 28 (2), pp.210-224.
    4. On the sum-max graph partitioning problem
      Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König
      Theoretical Computer Science, Elsevier, 2014, Combinatorial Optimization: Theory of algorithms and Complexity, 540, pp.143-155.

    2013

    1. Approximating a coupled-task scheduling problem in the presence of compatibility graph and additional tasks
      Rodolphe Giroudeau, Jean-Claude König, Gilles Simonin
      International Journal of Planning and Scheduling, Inderscience, 2013, 1 (en cours de publication) (4), pp.285-300.
    2. Multicast Routing in WDM Networks without Splitters
      Dinh Danh Le, Miklós Molnár, Jérôme Palaysi
      Infocommunications Journal, Scientific Association for Infocommunications, Hungary (HTE), 2013, 5 (2), pp.1-10.

Communications internationales

2014

  1. Coupled-Tasks in Presence of Bipartite Compatibilities Graphs
    Benoit Darties, Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König
    Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers. ISCO: International Symposium on Combinatorial Optimization, 2014, Lisbon, Portugal. Springer, 13rd International Symposium on Combinatorial Optimization, LNCS (8596), pp.161-172, 2014, Combinatorial Optimization.

2011

  1. Checkpointing strategies for parallel jobs.
    Marin Bougeret, Henri Casanova, Mikael Rabie, Yves Robert, Frédéric Vivien
    SuperComputing (SC) - International Conference for High Performance Computing, Networking, Storage and Analysis, 2011, 2011, United States. pp.1-11, 2011.
  2. 2018

    1. Solving the robust CVRP under demand uncertainty
      Artur Pessoa, Michael Poss, Ruslan Sadykov, François Vanderbeck
      ODYSSEUS 2018 - 7th International Workshop on Freight Transportation and Logistics, Jun 2018, Calgliari, Italy. 2018. <https://eventegg.com/odysseus/>

    2017

    1. On the Linearization of Scaffolds Sharing Repeated Contigs
      Mathias Weller, Annie Chateau, Rodolphe Giroudeau
      COCOA: Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. Springer, 11th International Conference on Combinatorial Optimization and Applications, LNCS (10628), 2017, Part II. <10.1007/978-3-319-71147-8_38>
    2. New Insights for Power Edge Set Problem
      Benoit Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
      X. Gao; H. Du; M. Han. COCOA: Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. Springer, 11th International Conference on Combinatorial Optimization and Applications, LNCS (10627), pp.180-194, 2017, Part I.
    3. On the QoS routing with RPL
      Walid Khallef, Miklós Molnár, Abderrahim Benslimane, Sylvain Durand
      PEMWN: Performance Evaluation and Modeling in Wired and Wireless Networks, Nov 2017, Paris, France. IEEE, 6th IFIP International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks, 2018. <10.23919/PEMWN.2017.8308028>
    4. Measuring Differences To Compare Sets Of Models And Improve Diversity In MDE
      Adel Ferdjoukh, Florian Galinier, Eric Bourreau, Annie Chateau, Clémentine Nebut
      ICSEA: International Conference on Software Engineering Advances, Oct 2017, Athenes, Greece. International Conference on Software Engineering Advances, 2017. <https://www.iaria.org/conferences2017/CfPICSEA17.html>
    5. On robust FSO network dimensioning
      Fabio D'Andreagiovanni, Dritan Nace, Michal Pioro, Michael Poss, Marinela Shehaj, Artur Tomaszewski
      Resilient Networks Design and Modeling (RNDM), Sep 2017, Alghero, Italy. 9th International Workshop on Resilient Networks Design and Modeling, 2017. <10.1109/RNDM.2017.8093027>
    6. Distance-2 Collision-Free Broadcast Scheduling in Wireless Networks
      Valentin Pollet, Jean-Claude König, Vincent Boudet
      FedCSIS: Federated Conference on Computer Science and Information Systems, Sep 2017, Prague, Czech Republic. Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, 2017. <10.15439/2017F140>
    7. Improved Complexity for Power Edge Set Problem
      Benoit Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
      IWOCA: International Workshop on Combinatorial Algorithms, Jul 2017, Newcastle, Australia. 28th International Workshop on Combinatorial Algorithms, 2017. <https://carma.newcastle.edu.au/meetings/iwoca/>
    8. Non-elementary routes for multicasting in Transparent Optical Networks
      Miklós Molnár
      ICTON: International Conference on Transparent Optical Networks, Jul 2017, Girona, Spain. IEEE, 19th International Conference on Transparent Optical Networks (ICTON), IEEE, 2017. <10.1109/ICTON.2017.8025135>
    9. Multiple constrained QoS routing with RPL
      Khallef Walid, Miklós Molnár, Abderrahim Benslimane, Sylvain Durand
      ICC: International Conference on Communications, May 2017, Paris, France. IEEE, 2017 IEEE International Conference on Communications (ICC), pp.1-6, 2017, ICC'17: Bridging People, Communities, and Cultures.

    2016

    1. On Complexity and Residual Approximation in Solution Extension Problems
      Rodolphe Giroudeau, Annie Château, Jean-Claude König, Mathias Weller, Valentin Pollet
      COCOA: Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. 10th Annual International Conference on Combinatorial Optimization and Applications, LNCS (10043), 2016, Combinatorial Optimization and Applications. <https://conference.cs.cityu.edu.hk/cocoa2016/>
    2. Instance guaranteed ratio for the Scaffolding problem
      Rodolphe Giroudeau, Annie Château, Clément Dallard, Mathias Weller
      COCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. 10th Annual International Conference on Combinatorial Optimization and Applications, 2016. <https://conference.cs.cityu.edu.hk/cocoa2016/>
    3. Certification under Uncertainties of Control Methods for Multi-Source Elevators
      Chloé Desdouits, Mazen Alamir, Rodolphe Giroudeau, Claude Le Pape
      ISDA: Intelligent Systems Design and Applications, Dec 2016, Porto, Portugal. 16th International Conference on Intelligent Systems Design and Applications, Advances in Intelligent Systems and Computing, v (577), pp.154-164, 2017.
    4. Production scheduling with piecewise-linear energy costs
      Rodolphe Giroudeau, Chloé Desduits, Mustafa Haouassi
      SSCI: Symposium Series on Computational Intelligence , Dec 2016, Athènes Greece. IEEE Symposium Series on Computational Intelligence, 2016. <http://ssci2016.cs.surrey.ac.uk>
    5. Genetic Algorithm to Improve Diversity in MDE
      Florian Galinier, Eric Bourreau, Annie Château, Adel Ferdjoukh, Clémentine Nebut
      META: Metaheuristics and Nature Inspired Computing, Oct 2016, Marrakech, Morocco. 6th International Conference on Metaheuristics and Nature Inspired Computing, 2016. <https://meta2016.sciencesconf.org/>
    6. A Graph Constraints Formulation for Contigs Scaffolding
      Rodolphe Giroudeau, Annie Château, Clément Dallard, Eric Bourreau
      WCB: Workshop on Constraint-Based Methods for Bioinformatics, Sep 2016, Toulouse, France. 12th International Workshop on Constraint-Based Methods for Bioinformatics, pp.136-149, 2016.
    7. The sourcing problem: energy optimization of a multisource elevator
      Chloé Desdouits, Mazen Alamir, Rodolphe Giroudeau, Claude Le Pape
      ICINCO: International Conference on Informatics in Control, Automation and Robotics, Jul 2016, Lisbonne, Portugal. SciTePress, 13th International Conference on Informatics in Control, Automation and Robotics, pp.19-30, 2016.
    8. Exploring Accurate Spatial Downscaling using Optimization
      Didier Josselin, Michael Poss
      Spatial Accuracy'2016, Jul 2016, Montpellier, France. Proceedings of Spatial Accuracy'2016.
    9. A Model-Driven Approach to Generate Relevant and Realistic Datasets
      Adel Ferdjoukh, Eric Bourreau, Annie Château, Clémentine Nebut
      SEKE: Software Engineering and Knowledge Engineering, Jul 2016, Redwood City, San Francisco Bay, United States. 28th International Conference on Software Engineering and Knowledge Engineering, pp.105-109, 2016.
    10. Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem
      Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau
      ISCO: International Symposium on Combinatorial Optimization, May 2016, Vietri sul Mare, Italy. 4th International Symposium on Combinatorial Optimization, LNCS (9849), pp.148-159, 2016, Combinatorial Optimization.
    11. Bounds and approximation results for scheduling coupled-tasks with compatibility constraints
      Rodolphe Giroudeau, Jean-Claude König, Benoit Darties, Gilles Simonin
      PMS: Project Management and Scheduling, Apr 2016, Valencia, Spain. 15th International Conference on Project Management and Scheduling, pp.94-97, 2016.
    12. Distributed monitoring in 6LoWPAN based Internet of Things
      Basma Mostafa, Abderrahim Benslimane, Eric Bourreau, Miklós Molnár, Mohamed Saleh
      IEEE. MoWNeT: Mobile & Wireless Networking, Apr 2016, Cairo, Egypt. pp.1-7, 2016, 2016 International Conference on Selected Topics in Mobile Wireless Networking (MoWNeT).
    13. Résolution exacte du problème de routage multicast multi-contraint de coût minimal
      Walid Khallef, Sylvain Durand, Miklós Molnár
      ROADEF: Recherche Opérationnelle et d'Aide à la Décision, Feb 2016, Compiègne, France. 2016.

    2015

    1. On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs
      Mathias Weller, Annie Château, Rodolphe Giroudeau
      COCOA: Combinatorial Optimization and Applications, Dec 2015, Houston, United States. COCOA 2015 - The 9th Annual International Conference on Combinatorial Optimization and Applications 9486, pp.409-423, 2015, LNCS.
    2. A restoration framework for partial failures in wireless networks
      Yoann Fouquet, Dritan Nace, Michal Pioro, Michael Poss
      RNDM: Reliable Networks Design and Modeling, Oct 2015, Munich, Germany. The 7th International Workshop on Reliable Networks Design and Modeling, 2015.
    3. Travelling Salesmen on Bounded Degree Trails
      Andras Sebo, Alantha Newman, Miklós Molnár
      Routing and Network Design Workshop, Sep 2015, Bonn, Germany.
    4. Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations
      Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant
      FCT: Fundamentals of Computation Theory, Aug 2015, Gdańsk, Poland. 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, LNCS (9210), pp.189-201, 2015, Fundamentals of Computation Theory.
    5. Improved Exact Resolution of Multi-Constrained Path Problem
      Khallef Walid, Sylvain Durand, Miklós Molnár
      t Resolution of Multi-Constrained Path Problem. EURO: European Conference on Operational Research, Jul 2015, Glasgow, United Kingdom. 2015, 27th European Conference on Operational Research (EURO2015). <http://euro2015.euro-online.org/>
    6. On the complexity of flexible interval scheduling
      Marin Bougeret, Rodolphe Giroudeau, Guillerme Duvillié
      MAPSP: Models and Algorithms for Planning and Scheduling Problems, Jun 2015, La Roche-en-Ardenne, Belgium. 12th Workshop on Models and Algorithms for Planning and Scheduling Problems, 2015. <http://feb.kuleuven.be/mapsp2015/>
    7. On the Complexity of Wafer-to-Wafer Integration
      Guillerme Duvillié, Marin Bougeret, Vincent Boudet, Trivikram Dokka, Rodolphe Giroudeau
      CIAC: International Conference on Algorithms and Complexity, May 2015, Paris, France. 9th International Conference on Algorithms and Complexity, LNCS (9079), pp.208-220, 2015, Algorithms and Complexity.
    8. Instantiation of meta-models constrained with OCL: A CSP approach
      Adel Ferdjoukh, Anne-Elisabeth Baert, Eric Bourreau, Annie Château, Remi Coletta, Clémentine Nebut
      MODELSWARD: Model-Driven Engineering and Software Development, Feb 2015, Angers, France. Proceedings of the third International Conference on Model Driven Engineering and Software Development, pp.213-222, 2015.

    2014

    1. Elastic Rerouting – models and resolution methods
      Yoann Fouquet, Dritan Nace, Michal Pioro, Michael Poss, Mateusz Zotkiewicz
      RNDM: Reliable Networks Design and Modeling, Nov 2014, Barcelona, Spain. 6th International Workshop on Reliable Networks Design and Modeling, 2014. <http://www.rndm.pl/2014/>
    2. Approximation algorithm for constrained coupled-tasks scheduling problem
      Gilles Simonin, Benoit Darties, Jean-Claude König, Rodolphe Giroudeau
      CoDIT: Control, Decision and Information Technologies, Nov 2014, Metz, France. pp.110-112, 2014.
    3. Flow adjustment methods for survivable networks
      Yoann Fouquet, Dritan Nace, Michal Pioro, Michael Poss, Mateusz Zotkiewicz
      Networks: Telecommunications Network Strategy and Planning, Sep 2014, Funchal, Madeira Island, Portugal. 2014, 16th International Telecommunications Network Strategy and Planning Symposium.
    4. Approximation of the Degree-Constrained Minimum Spanning Hierarchies
      Miklós Molnár, Sylvain Durand, Massinissa Merabet
      SIROCCO: Structural Information and Communication Complexity, Jul 2014, Takayama, Japan. Springer International Publishing, 21th International Colloquium on Structural Information and Communication Complexity July 23 - 25, 2014, Hida Takayama, Japan, LNCS (8576), pp.96-107, 2014.
    5. Flow Adjustment - a Flexible Routing Strategy for Demand Protection Against Multiple Partial Link Failures
      Yoann Fouquet, Dritan Nace, Michal Pioro, Michael Poss
      IARIA. INFOCOMP: International Conference on Advanced Communications and Computation, Jul 2014, Paris, France. The Fourth International Conference on Advanced Communications and Computation INFOCOMP 2014 July 20 - 24, 2014 - Paris, France, 4, pp.83-90, 2014.
    6. Reliability analysis with ill-known probabilities and dependencies
      Sebastien Destercke, Michael Poss, Mohamed Sallak
      International Conference on Vulnerability and Risk Analysis and Management (ICVRAM 2014), Jul 2014, Liverpool, United Kingdom. 2nd International Conference on Vulnerability and Risk Analysis and Management (ICVRAM) and the sixth International Symposium on Uncertainty Modeling and Analysis (ISUMA), pp.887-894, 2014.
    7. Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem
      Annie Château, Rodolphe Giroudeau
      Dediu, Adrian-Horia; Martín-Vide, Carlos; Truthe, Bianca. AlCoB: Algorithms for Computational Biology, Jul 2014, Tarragona, Spain. Springer International Publishing, First International Conference, AlCoB 2014, Tarragona, Spain, July 1-3, 2014, Proceedigns, LNCS (8542), pp.47-58, 2014, Algorithms for Computational Biology.
    8. A New Formulation of Degree-Constrained Spanning Problems
      Miklós Molnár, Sylvain Durand, Massinissa Merabet
      (Extended Abstract). ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France. 9th International Colloquium on Graph Theory and combinatorics, 2014. <http://oc.inpg.fr/conf/icgt2014/>
    9. Healing Wireless Sensor Networks from Malicious Epidemic Diffusion
      Nicola Roberto Zema, Enrico Natalizio, Michael Poss, Giuseppe Ruggeri, Antonella Molinaro
      DCOSS: Distributed Computing in Sensor Systems, May 2014, Marina del Rey, California, United States. 10th IEEE International Conference on Distributed Computing in Sensor Systems, pp.171-178, 2014.
    10. Scheduling coupled-tasks with incompatibility constraint: a bin-packing related problem
      Gilles Simonin, Benoit Darties, Rodolphe Giroudeau, Jean-Claude König
      BPPC: Bin Packing and Placement Constraints, May 2014, Cork, Ireland. Fifth International Workshop on Bin Packing and Placement Constraints, BPPC'14 - May 19th 2014, Cork, Ireland., 2014.
    11. An optimization model for communication networks resilient to partial multiple link failures
      Michal Pioro, Yoann Fouquet, Dritan Nace, Michael Poss, Mateusz Zotkiewicz
      INFORMS Telecommunications Conference, Mar 2014, Lisbonne, Portugal. The 12th INFORMS Telecommunications Conference, 2014. <http://www.informstelecom2014.fc.ul.pt>
    12. Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs
      Marin Bougeret, Nicolas Bousquet, Rodolphe Giroudeau, Rémi Watrigant
      SOFSEM: Current Trends in Theory and Practice of Computer Science, Jan 2014, High Tatras, Slovakia. 40th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings, 8327, pp.150-161, 2014, LNCS.
    13. Light-trail based hierarchy: the optimal multicast route in WDM networks without splitters and converters
      Dinh Danh Le, Massinissa Merabet
      SCITEPRESS. Photoptics'2014: 2nd International Conference on Photonics, Optics and Laser Technology, Jan 2014, Portugal. pp.8, 2014.

    2013

    1. A CSP Approach for Metamodel Instantiation
      Adel Ferdjoukh, Anne-Elisabeth Baert, Annie Château, Remi Coletta, Clémentine Nebut
      ICTAI: International Conference on Tools with Artificial Intelligence, Nov 2013, Washington, United States. 25th IEEE International Conference on Tools with Artificial Intelligence, pp.1044-1051, 2013.
    2. Approximating the Sparsest $k$-Subgraph in Chordal Graphs
      Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau
      WAOA: Workshop on Approximation and Online Algorithms, Sep 2013, Sophia Antipolis, France. 11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers, LNCS (8447), pp.73-84, 2014, Approximation and Online Algorithms.
    3. Combined Time Synchronization and Efficient Data Gathering for Wireless Sensor Networks
      Jérôme Mathieu, Vincent Boudet, Sylvain Durand, Jérôme Palaysi
      SENSORCOMM: Sensor Technologies and Applications, Aug 2013, Barcelone, Spain. The Seventh International Conference on Sensor Technologies and Applications SENSORCOMM 2013 August 25 - 31, 2013 - Barcelona, Spain, 2013. <http://www.iaria.org/conferences2013/SENSORCOMM13.html>
    4. Exact solution for branch vertices constrained spanning problems
      Massinissa Merabet, Sylvain Durand, Miklós Molnár
      INOC: International Network Optimization Conference, May 2013, Tenerife, Spain. 2013. <http://eventos.ull.es/inoc2013/>
    5. An Improved Multicast Routing Algorithm in Sparse Splitting WDM Networks
      Miklós Molnár, Dinh Danh Le, Jérôme Palaysi
      ComManTel: Computing, Management and Telecommunications, Jan 2013, Ho Chi Minh City, Vietnam. The International Conference on Computing, Management and Telecommunications, pp.99-104, 2013.

Publications majeures

 

  • M. Pioro, D. Nace, Michael Poss and Y. Fouquet: An optimization model for multicommodity flow networks with partial multiple link failures. Accepted in Operations Research
  • R. Watrigant M. Bougeret and R. Giroudeau : Approximating the Sparsest k-Subgraph in Chordal Graphs, Journal of Theory of Computing Systems, 58(1): 111-132 (2016).
  • F. Castano, E. Bourreau, N. Velasco, A. Rossi, M. Sevaux, Exact approaches for lifetime maximization in connectivity constrained wireless multi-role sensor networks, European Journal of Operational Research (EJOR), Vol 241, No 1, Février 2015, pp 28-38

  • Vincent Boudet, Sylvain Durand, Jérôme Palaysi, Jérôme Mathieu and László Gönczy Efficient Gatherings in Wireless Sensor Networks Using Distributed Computation of Connected Dominating Sets Sensors & Transducers Journal, Vol. 14-2, pp.297-307, Special Issue, March 2012
  • Dinh Danh Le, Fen Zhou, Miklos Molnar. Minimizing Blocking Probability for MCRWA problem in WDM Networks: Exact Solutions and Heuristic Algorithms. IEEE / OSA Journal of Optical Communications and Networking, 7(1): pp36-48, Jan. 2014

Voir toutes les publications de l'équipe

Collaborations

Ces dernières années, MAORE a établi de nombreuses collaborations qui ont donné lieu à des publications ou des projets en commun.Internes - ALGECO, MAB (Département Informatique, co-encadrement de postdoc), MAREL (Département Informatique, co-encadrement de thèse), SYSMIC (Département Micro-éléctronique, co-encadrement de thèse), EXPLORE (Département Robotique, projet KARST)Nationales - Realopt (INRIA Bordeaux), Heudiasyc (UTC), LIA (Université d’Avignon), Université Toulouse Capitole, G-SCOP (Grenoble), IRISA (Rennes), LGI2P (Université de Nîmes), Gipsa-lab (Université de Grenoble), LabSticc (Université Bretagne Sud)Internationales - Belgique : Université Libre de Bruxelles, University of Leuveen. Brésil : Universidade Federal Fluminense, Universidade Estadual do rio de Janeiro. Chine : University of Science and Technology of China. Colombie : Universidad de los Andes, Bogotá, Universidad de Ibague, Tolima. Espagne : Universitat Politècnica de Catalunya. Hongrie : Budapest University of Technology and Economic. Italie : IASI-CNR, University of Calabria. Irelande : College Cork. Pologne : Warsaw University of Technology. Portugal : Universidade de Aveiro. Royaume-Uni : University of Lancaster. Suède: Lund University.

Projets de recherche (depuis 2013)

Projets académiques

  • ANR CUTTER (10-14) avec l’équipe MAREL du LIRMM et RODMOD de Lille
  • Routing problems under demand and travel time uncertainty. Projet bilatéral avec le Portugal financé par PHC. Janvier 2014 - Décembre 2015.
  • Adjustable robust optimization applied to network design problems. Projet collaboratif financé par le PGMO (EDF, FMJH), et incluant l’UMR CNRS 7253 Heudiasyc, l’UMR 5157 SAMOVAR, CNR – IASI (Italie), RWTH Aachen University (Allemagne), UFF- LOGIS (Brésil). Janvier 2014 - Décembre 2015.
  • Combinatorial robust optimization with budgeted uncertainty. Projet collaboratif financé par le PGMO (EDF, FMJH), et incluant l’équipe projet INRIA Realopt, UFF- LOGIS (Brésil), CIDMA (Portugal). Janvier 2016 - Décembre 2017.
  • Monitoring of IoT and CPS Networks, MONIOT Projet bilatéral  PHC IMHOTEP avec l’Université Française d'Egypte (UFE) et University of Cairo en Egypte. Janvier 2015 - Décembre  2016.
  • NiceCAMPUS Lab, projet AUF avec l’Université de Nice et l’Université de Da Nang (Vietnam), depuis 2015.

Contrats industriels

  • Berger-Levrault : Ordonnancement et planification des soins, des rendez-vous et du personnel (janvier - décembre 2013)
  • Teads : Conseil pour le développement d’algorithmes pour l’optimisation de la gestions des publicités sur Internet (novembre 2014-Avril 2015)
  • Schneider : Minimisation de la consommation d’énergie, thèse CIFFRE

Faits marquants

 

  •  Renforcement de l'orientation Recherche Opérationelle : arrivée d'Eric Bourreau et de Michael Poss, rapprochement avec l'équipe des Mines d'Alès.
  • Collaboration avec l'Université Française d'Egypte.
  • Participation à l'organisation de l'ESGI 2016 à l'Université d'Avignon et des Pays de Vaucluse (http://esgi2016uapv.sciencesconf.org/)

Anciens membres

 

  • Permanents :
    • Alain Jean-Marie,
    • Ehoud Ahronovitz,
    • Olivier Cogis,
    • Marin Bougeret
     
  • Doctorants et/ou post-doc :
    • Julien Champ,
    • Gilles Simonin,
    • Benoit Darties,
    • Remi Watrigant,
    • Clément Saad,
    • Xavier Roche,
    • Jean-Francois Pineau
    • Massinissa Merabet
    • Olivia Morad
    • Florent Hernandez
    • Dinh Danh Le
     

Mots-clés

Recherche Opérationnelle, Approximation, Réseaux, Ordonnancement, Optimisation Combinatoire, Complexité, Optimisation robuste, Programmation Mathématique, Programmation par contraintes

Dernière mise à jour le 29/03/2018

Département : Informatique

Responsable : Vincent BOUDET

Adjoint : Michael POSS

Fiche-équipe MAORE

Télécharger la fiche-équipe MAORE du rapport d'activité 2008-2013 :

Séminaires MAORE

Les séminaires de l'équipe MAORE ont lieu une fois par mois environ et présentent des sujets proches des thématiques de l'équipe: Recherche Opérationnelle, Approximation, Réseaux, Ordonnancement.

Meetings MAORE

Le planning est disponible ici.