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

The members of MAORE are using the tools of combinatorial optimization, graph theory, mathematical programming, and constraint programming to solve discrete optimization problems exactly or approximately. Our main application fields are networks and scheduling. Our analysis addresses the complexity, approximability and robustness. We are interested in the theoretical properties of the algorithms as well as in their numerical efficiency on real instances. The application studied have led collaborations with researchers of various fields (microelectronics, robotics, bio-informatics, software engineering).

Members

Staff

Associates & Students

Regular Co-workers

  • Benoit Darties, Assistant Professor

Research axes

Three research axes can be identified:

Main publications

  • 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

See all publications of the team

Collaborations

In the last years, MAORE has established various collaborations that have resulted in joint publications and/or research projects.

Local - ALGECO, MAB (Computer science department, co-supervision of postdoc), MAREL (Computer science department, co-supervision of PhD), SYSMIC (Microeletronics department, o-supervision of PhD), EXPLORE (Robotics department, project KARST)

National - 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)

International - Belgium : Université Libre de Bruxelles, University of Leuveen. Brazil : Universidade Federal Fluminense, Universidade Estadual do rio de Janeiro. China : University of Science and Technology of China. Colombia : Universidad de los Andes, Bogotá, Universidad de Ibague, Tolima. Spain : Universitat Politècnica de Catalunya. Hungary : Budapest University of Technology and Economic. Italy : IASI-CNR, University of Calabria. Ireland : College Cork. Pologne : Warsaw University of Technology. Portugal : Universidade de Aveiro. United Kingdom : University of Lancaster. Sweden : Lund University.

Research projects (from 2013)

Public funding

  • ANR CUTTER (10-14) with MAREL from LIRMM and RODMOD from Lille
  • Routing problems under demand and travel time uncertainty. Bilateral project with Portugal, funded par PHC. January 2014 - December 2015.
  • Adjustable robust optimization applied to network design problems. Collaborative project funded by PGMO (EDF, FMJH), including UMR CNRS 7253 Heudiasyc, UMR 5157 SAMOVAR, CNR – IASI (Italy), RWTH Aachen University (Germany), UFF- LOGIS (Brésil). January 2014 - December 2015.
  • Combinatorial robust optimization with budgeted uncertainty. Collaborative project funded by PGMO (EDF, FMJH), including team-project INRIA Realopt, UFF- LOGIS (Brazil), CIDMA (Portugal). January 2016 - December 2017.
  • Monitoring of IoT and CPS Networks, MONIOT Bilateral project  PHC IMHOTEP with the Université Française d'Egypte (UFE) and the University of Cairo en Egypte. January 2015 - December  2016.
  • NiceCAMPUS Lab, project AUF with the Université de Nice and the l’Université de Da Nang (Vietnam), from 2015.

Industrial contracts

Berger-Levrault : Scheduling and planning of treatements and meetings of the staff (january - december 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

Highlights

  •  Reinforcement of the axis Operations Research of the team : Eric Bourreau and Michael Poss, joined the team, link with the team from the Ecole des Mines d'Alès.
  • Collaboration with the Université Française d'Egypte.
  • Organization of ESGI 2016 at theUniversité d'Avignon et des Pays de Vaucluse (http://esgi2016uapv.sciencesconf.org/)

Former members

Permanents members :

  • Alain Jean-Marie,
  • Ehoud Ahronovitz,
  • Olivier Cogis,
  • Marin Bougeret

PhD and 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

Publications 2014 - 2019: Evaluation period

International Journals

2021

  1. Identifying relatively irreducible infeasible subsystems of linear inequalities
    Jérémy Omer, Michael Poss
    Annals of Operations Research, Springer Verlag, 2021, 304, pp.361-379.
  2. Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds
    Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller, Dorine Tabary
    Algorithmica, Springer Verlag, 2021. <10.1007/s00453-021-00819-6>

2020

  1. A constraint-programming based decomposition method for the Generalised Workforce Scheduling and Routing Problem (GWSRP)
    Eric Bourreau, Thierry Garaix, Matthieu Gondran, Philippe Lacomme, Nikolay Tchernev
    International Journal of Production Research, Taylor & Francis, In press, pp.1-19.
  2. A polynomial algorithm for minimizing travel time in time-dependent networks with waits
    Jérémy Omer, Michael Poss
    Networks, Wiley, 2020. <10.1002/net.21994>
  3. Min-Max-Min Robustness for Combinatorial Problems with Discrete Budgeted Uncertainty
    Marc Goerigk, Jannis Kurtz, Michael Poss
    Discrete Applied Mathematics, Elsevier, 2020, 285, pp.707-725.
  4. Robust inventory theory with perishable products
    Marcio Costa Santos, Agostinho Agra, Michael Poss
    Annals of Operations Research, Springer Verlag, 2020, 289 (2), pp.473-494.
  5. Proof of usage: user-centric consensus for data provision and exchange
    Samuel Masseport, Jorick Lartigau, Benoit Darties, Rodolphe Giroudeau
    Annals of Telecommunications - annales des télécommunications, Springer, 2020, 75 (3-4), pp.153-162.
  6. A robust optimization model for affine/quadratic flow thinning -a traffic protection mechanism for networks with variable link capacity
    Ilya Kalesnikau, Michał Pióro, Michael Poss, Dritan Nace, Artur Tomaszewski
    Networks, Wiley, 2020, 75 (4), pp.420-437.
  7. Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator
    Adrien Cambier, Matthieu Chardy, Rosa Figueiredo, Adam Ouorou, Michael Poss
    Networks, Wiley, In press. <10.1002/net.21970>
  8. Solution Algorithms for Minimizing the Total Tardiness with Budgeted Processing Time Uncertainty
    Marco Silva, Michael Poss, Nelson Maculan
    European Journal of Operational Research, Elsevier, 2020, 283 (1), pp.70-82.
  9. Branch-and-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
    Artur Alves Pessoa, Michael Poss, François Vanderbeck, Ruslan Sadykov, Francois Vanderbeck
    Operations Research, INFORMS, In press. <10.1287/opre.2020.2035>
  10. A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits
    Jérémy Omer, Michael Poss
    Networks, Wiley, In press. <10.1002/net.21994>

2019

  1. Minimizing Energy and Link Utilization in ISP Backbone Networks with multi-path Routing: A Bi-level Approach
    Ikram Bouras, Rosa Figueiredo, Michael Poss, Fen Zhou
    Optimization Letters, Springer Verlag, 2019.
  2. Multicast routing from a set of data centers in elastic optical networks
    Miklós Molnár, Dinh Danh Le, Jordi Perelló, Josep Solé-Pareta, Conor Mcardle
    Optical Switching and Networking, Elsevier, 2019, 34, pp.35-46.
  3. The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach
    Luigi Di Puglia Pugliese, Francesca Guerriero, Michael Poss
    Computers and Operations Research, Elsevier, 2019, 107, pp.140-155.
  4. Parameterized complexity of a coupled-task scheduling problem
    Stéphane Bessy, Rodolphe Giroudeau
    Journal of Scheduling, Springer Verlag, 2019, 22 (3), pp.305-313.
  5. Faster Algorithms for Min-max-min Robustness for Combinatorial Problems with Budgeted Uncertainty
    André Chassein, Marc Goerigk, Jannis Kurtz, Michael Poss
    European Journal of Operational Research, Elsevier, 2019. <10.1016/j.ejor.2019.05.045>
  6. A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions
    Olivier Baudon, Julien Bensmail, Tom Davot, Hervé Hocquard, Jakub Przybyło, Mohammed Senhaji, Eric Sopena, Mariusz Woźniak
    Discrete Mathematics and Theoretical Computer Science, DMTCS, 2019, ICGT 2018, 21 (1).
  7. On Two New Formulations for the Fixed Charge Network Design Problem with Shortest Path Constraints
    Ikram Bouras, Rosa Figueiredo, Michael Poss, Fen Zhou
    Computers and Operations Research, Elsevier, 2019, 108, pp.226-237.
  8. An optimization model for quadratic flow thinning – a traffic protection mechanism for FSO networks
    Michał Pióro, Ilya Kalesnikau, Michael Poss
    Optical Switching and Networking, Elsevier, 2019, 31, pp.168-182.
  9. Proportional and maxmin fairness for the sensor location problem with chance constraints
    Marcio Santos, Hannan Luss, Dritan Nace, Michael Poss
    Discrete Applied Mathematics, Elsevier, 2019, 261 (31), pp.316-331.
  10. An optimization model for robust FSO network dimensioning
    Dritan Nace, Michał Pióro, Michael Poss, Fabio D’andreagiovanni, Ilya Kalesnikau, Marinela Shehaj, Artur Tomaszewski
    Optical Switching and Networking, Elsevier, 2019, 32, pp.25-40.
  11. Distance Transformation for Network Design Problems
    Ali Ridha Mahjoub, Michael Poss, Luidi Simonetti, Eduardo Uchoa
    SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2019, 29 (2), pp.1687-1713.
  12. Time-dependent shortest path with discounted waits
    Jérémy Omer, Michael Poss
    Networks, Wiley, 2019, 74 (3), pp.287-301.

2018

  1. Trains do not vanish: the ROADEF/EURO challenge 2014
    Christian Artigues, Eric Bourreau, Vincent Jost, Safia Kedad-Sidhoum, François Ramond
    Annals of Operations Research, Springer Verlag, 2018, 271 (2), pp.1091-1105.
  2. On Residual Approximation in Solution Extension Problems
    Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet
    Journal of Combinatorial Optimization, Springer Verlag, 2018, 36 (4), pp.1195-1220.
  3. Approximability and exact resolution of the multidimensional binary vector assignment problem
    Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau
    Journal of Combinatorial Optimization, Springer Verlag, 2018, 36 (3), pp.1059-1073.
  4. ILP formulation of the degree-constrained minimum spanning hierarchy problem
    Massinissa Merabet, Miklós Molnár, Sylvain Durand
    Journal of Combinatorial Optimization, Springer Verlag, 2018, 36 (3), pp.789-811.
  5. Complexity and lowers bounds for Power Edge Set Problem
    Benoit Darties, Nicolas Champseix, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
    Journal of Discrete Algorithms, Elsevier, 2018, 52-53, pp.70-91.
  6. Robust scheduling with budgeted uncertainty
    Marin Bougeret, Artur Alves Pessoa, Michael Poss
    Discrete Applied Mathematics, Elsevier, 2018, 261 (31), pp.93-107.
  7. Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases
    Mathias Weller, Annie Chateau, Clément Dallard, Rodolphe Giroudeau
    Algorithmica, Springer Verlag, 2018, 80 (6), pp.1771-1803.
  8. Optimizing Make-To-Stock policies through a robust lot-sizing model
    Agostinho Agra, Michael Poss, Micael Santos
    International Journal of Production Economics, Elsevier, 2018, 200, pp.302-310.
  9. Optimizing power generation in the presence of micro-grids
    Wim van Ackooij, Jérôme de Boeck, Boris Detienne, Stefania Pan, Michael Poss
    European Journal of Operational Research, Elsevier, 2018, 271 (2), pp.450-461.
  10. 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.
  11. 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.
  12. 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.
  13. Robust combinatorial optimization with knapsack uncertainty
    Michael Poss
    Discrete Optimization, Elsevier, 2018, 27, pp.88 - 102.
  14. Minimizing the weighted sum of completion times under processing time uncertainty
    Zacharie Alès, Thi Sang Nguyen, Michael Poss
    Electronic Notes in Discrete Mathematics, Elsevier, 2018, 64, pp.15 - 24.
  15. An Energy-Efficient Multiobjective Scheduling Model for Monitoring in Internet of Things
    Basma Mostafa Hassan, Abderrahim Benslimane, Mohamed Saleh, Sally Kassem, Miklós Molnár
    IEEE internet of things journal, IEEE, 2018, 5 (3), pp.1727-1738.
  16. $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.
  17. Path Generation for Affine Flow Thinning
    Michał Pióro, Ilya Kalesnikau, Michael Poss
    Electronic Notes in Discrete Mathematics, Elsevier, 2018, 64, pp.355 - 364.
  18. A perfect information lower bound for robust lot-sizing problems
    Marcio Santos, Michael Poss, Dritan Nace
    Annals of Operations Research, Springer Verlag, 2018, 271 (2), pp.887-913.
  19. Solving the bifurcated and nonbifurcated robust network loading problem with k-adaptive routing
    Marco Silva, Michael Poss, Nelson Maculan
    Networks, Wiley, 2018, Special Issue: Special Issue “New Advances and Applications in Deterministic and Stochastic Network Optimization”, 72 (1), pp.151-170.
  20. Measurement and Generation of Diversity and Meaningfulness in Model Driven Engineering
    Adel Ferdjoukh, Florian Galinier, Eric Bourreau, Annie Chateau, Clémentine Nebut
    International Journal On Advances in Software, IARIA, 2018, 11 (1/2), pp.131-146.

2017

  1. Multidimensional Binary Vector Assignment problem: standard, structural and above guarantee parameterizations
    Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau, Rémi Watrigant
    Discrete Mathematics and Theoretical Computer Science, DMTCS, 2017, FCT '15, 19 (4). <10.23638/DMTCS-19-4-3>
  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
    Agostinho Agra, Marcio Costa Santos, Dritan Nace, Michael Poss
    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 Roberto Zema, Enrico Natalizio, Michael Poss, Giuseppe Ruggeri, Antonella Molinaro
    Ad Hoc Networks, Elsevier, 2016, 50, pp.115-127.
  5. 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.
  6. 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.
  7. 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.
  8. 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.
  9. 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.
  10. 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.
  11. Partial target coverage to extend the lifetime in wireless multi-role sensor networks
    Fabian Castaño, Eric Bourreau, André Rossi, Marc Sevaux, Nubia Velasco
    Networks, Wiley, 2016, 68 (1), pp.34-53.

2015

  1. Cautious label ranking with label-wise decomposition
    Sébastien Destercke, Marie-Hélène Masson, Michael Poss
    European Journal of Operational Research, Elsevier, 2015, 246 (3), pp.927-935.
  2. A complexity and approximation framework for the maximization scaffolding problem
    Annie Chateau, Rodolphe Giroudeau
    Theoretical Computer Science, Elsevier, 2015, 595, pp.92-106.
  3. 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, 27 (3), pp.431-578.
  4. 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.
  5. 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.
  6. Generalized Elastic Flow Rerouting Scheme
    Yoann Fouquet, Dritan Nace, Michal Pioro, Michael Poss, Mateusz Zotkiewicz
    Networks, Wiley, 2015, Optimization Issues in Resilient Network Design and Modeling, 66 (4), pp.267-281.
  7. 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.
  8. 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.
  9. Improved approximation algorithms for scheduling parallel jobs on identical clusters
    Marin Bougeret, Pierre-Francois Dutot, Denis Trystram, Klaus Jansen, Christina Robenek
    Theoretical Computer Science, Elsevier, 2015, 600, pp.70-85.
  10. Exact approaches for scaffolding
    Mathias Weller, Annie Chateau, Rodolphe Giroudeau
    BMC Bioinformatics, BioMed Central, 2015, 16 (Suppl 14), pp.S2.
  11. 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.

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.
  5. 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, Hindawi Publishing Corporation, 2014, 14 (17), pp.1627-1646.

International Communications

2020

  1. Exact method approaches for the differential harvest problem
    Gabriel Volte, Eric Bourreau, Rodolphe Giroudeau, Olivier Naud
    17th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR), Sep 2020, Vienna, Austria. pp.492-510.
  2. Constraint Programming Approaches for the RCPSP with Routing
    Eric Bourreau, Philippe Lacomme, Marina Vinot
    21ème congrès annuel de la Société française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF), Feb 2020, Montpellier, France. <https://roadef2020.sciencesconf.org/>
  3. Constraint Programming based Decomposition Method to the Generalised Workforce Scheduling and Routing Problem
    Eric Bourreau, Thierry Garaix, Matthieu Gondran, Philippe Lacomme, Nikolay Tchernev
    21ème congrès annuel de la Société française de Recherche Opérationnelle et d’Aide à la Décision (ROADEF), Feb 2020, https://roadef2020.sciencesconf.org/, France.
  4. Linearizing Genomes: Exact Methods and Local Search
    Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
    SOFSEM, Jan 2020, Limassol, Cyprus. pp.505-518.

2019

  1. The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs
    Benoit Darties, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet
    13th International Conference on Combinatorial Optimization and Applications (COCOA), Dec 2019, Xiamen, China. pp.449-460.
  2. Approximation results for makespan minimization with budgeted uncertainty
    Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder
    WAOA 2019, Sep 2019, Munich, Germany.
  3. Robust Two-Stage Packing into Designated and Multipurpose Bins
    Yacine Al Najjar, Noam Goldberg, Shlomo Karhi, Michael Poss
    9th IFAC Conference on Manufacturing Modelling, Management and Control (MIM), Aug 2019, Berlin, Germany. pp.397-402.
  4. Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs
    Pierre Cazals, Benoit Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
    30th International Workshop on Combinatorial Algorithms (IWOCA), Jul 2019, Pisa, Italy. pp.122-135.
  5. A local search for the Job-shop Scheduling Problem with Constraint Programming
    Eric Bourreau, Matthieu Gondran, Philippe Lacomme
    30th European Conference on Operational Research (EURO), Jun 2019, Dublin, Ireland. <http://www.euro2019dublin.com/>
  6. Distributionally robust airline fleet assignment problem
    Marco Silva, Michael Poss
    INOC: International European Network Conference, Jun 2019, Avignon, France. pp.66-71.
  7. The Workforce Routing and Scheduling Problem: solving real-world Instances
    Gabriel Volte, Chloé Desdouits, Rodolphe Giroudeau
    INOC: International Network Optimization Conference, Jun 2019, Avignon, France. pp.60-65.
  8. Optimizing the investments in mobile network technologies and designing of offers
    Adrien Cambier, Matthieu Chardy, Rosa Figueiredo, Adam Ouorou, Michael Poss
    International Network Optimization Conference, Jun 2019, Avignon, France.
  9. Efficient Constraint Programming Approaches for routing problem: a case study for the VRP
    Matthieu Gondran, Eric Bourreau, Philippe Lacomme
    7th Workshop of the EURO Working Group on Vehicle Routing and Logistics optimization (VeRoLog 2019), Jun 2019, Seville, Spain. <https://verolog2019.sciencesconf.org/>
  10. New Polynomial-Time Algorithm around the Scaffolding Problem
    Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
    AlCoB: Algorithms for Computational Biology, May 2019, Berkeley, United States. pp.25-38.
  11. Proof of Usage: User-centric consensus for data provision and exchange
    Samuel Masseport, Jorick Lartigau, Benoit Darties, Rodolphe Giroudeau
    BRAINS: Blockchain, Robotics and AI for Networking Security, Mar 2019, Rio De Janerio, Brazil. <https://brains.dnac.org/>
  12. Optimisation conjointe des investissements réseaux mobiles et des migrations des abonnés
    Adrien Cambier, Matthieu Chardy, Rosa Figueiredo, Adam Ouorou, Michael Poss
    ROADEF 2019, Feb 2019, Le Havre, France.

2018

  1. On the hardness of approximating Linearization of Scaffolds sharing Repeated Contigs
    Tom Davot, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
    RECOMB-CG: Comparative Genomics, Oct 2018, Magog-Orford, QC, Canada. pp.91-107.
  2. New Results About the Linearization of Scaffolds Sharing Repeated Contigs
    Dorine Tabary, Tom Davot, Mathias Weller, Annie Chateau, Rodolphe Giroudeau
    COCOA: Conference on Combinatorial Optimization and Applications, Sep 2018, Atlanta, GA, United States. pp.94-107.
  3. Practical aspects of Flow Thinning optimization
    Michal Pioro, Ilya Kalesnikau, Michael Poss, Dritan Nace, Artur Tomaszewski
    10th International Workshop on Resilient Networks Design and Modeling (RNDM 2018), Aug 2018, Longyearbyen, Norway. pp.1-8.
  4. Robust Optimization On GPU: a use case, shortest paths
    Eric Bourreau, Michael Poss, Cyril Bouvier
    EURO: European Conference on Operational Research, Jul 2018, Valencia, Spain. <http://euro2018valencia.com>
  5. Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator
    Adrien Cambier, Matthieu Chardy, Rosa Figueiredo, Adam Ouorou, Michael Poss
    EURO: European Conference on Operational Research, Jul 2018, Valencia, Spain. <http://euro2018valencia.com/>
  6. Exact Algorithms for Fixed Charge Network Design Problem with User-Optimal Flows
    Ikram Bouras, Rosa Figueiredo, Michael Poss, Fen Zhoo
    IWOBIP: International Workshop on Bilevel Programming, Jun 2018, Lille, France. <https://iwobip2.sciencesconf.org/>
  7. Solving the robust CVRP under demand uncertainty
    Artur Pessoa, Michael Poss, Ruslan Sadykov, François Vanderbeck
    ODYSSEUS, Jun 2018, Calgliari, Italy. <https://eventegg.com/odysseus/>
  8. Exact Algorithms for Fixed Charge Network Design Problem with User Optimal Flow
    Ikram Bouras, Rosa Figueiredo, Michael Poss, Fen Zhou
    ROADEF: Recherche Opérationnelle et d'Aide à la Décision, Feb 2018, Lorient, France.

2017

  1. On the Linearization of Scaffolds Sharing Repeated Contigs
    Mathias Weller, Annie Chateau, Rodolphe Giroudeau
    COCOA: Conference on Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. pp.509-517.
  2. New Insights for Power Edge Set Problem
    Benoit Darties, Annie Chateau, Rodolphe Giroudeau, Mathias Weller
    COCOA: Conference on Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. pp.180-194.
  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. <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. <https://www.iaria.org/conferences2017/CfPICSEA17.html>
  5. An optimization model for affine flow thinning — A traffic protection mechanism for FSO networks
    Michał Pióro, Ilya Kalesnikau, Michael Poss
    RNDM: Resilient Networks Design and Modeling, Sep 2017, Alghero, Italy. <10.1109/RNDM.2017.8093015>
  6. On robust FSO network dimensioning
    Fabio D’andreagiovanni, Dritan Nace, Michal Pioro, Michael Poss, Marinela Shehaj, Artur Tomaszewski
    9th International Workshop on Resilient Networks Design and Modeling (RNDM 2017), Sep 2017, Alghero, Italy. pp.1-8.
  7. Distance-2 Collision-Free Broadcast Scheduling in Wireless Networks
    Valentin Pollet, Vincent Boudet, Jean-Claude König
    FedCSIS: Federated Conference on Computer Science and Information Systems, Sep 2017, Prague, Czech Republic. pp.469-472.
  8. 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. pp.128-141.
  9. Non-elementary routes for multicasting in Transparent Optical Networks
    Miklós Molnár
    ICTON: International Conference on Transparent Optical Networks, Jul 2017, Girona, Spain. <10.1109/ICTON.2017.8025135>
  10. Multiple constrained QoS routing with RPL
    Walid Khallef, Miklós Molnár, Abderrahim Benslimane, Sylvain Durand
    ICC: International Conference on Communications, May 2017, Paris, France. <10.1109/ICC.2017.7997081>

2016

  1. On Residual Approximation in Solution Extension Problems
    Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet
    COCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.463-476.
  2. Instance Guaranteed Ratio on Greedy Heuristic for Genome Scaffolding
    Clément Dallard, Mathias Weller, Annie Chateau, Rodolphe Giroudeau
    COCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.294-308.
  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. pp.154-164.
  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. <http://ssci2016.cs.surrey.ac.uk>
  5. Genetic Algorithm to Improve Diversity in MDE
    Florian Galinier, Eric Bourreau, Annie Chateau, Adel Ferdjoukh, Clémentine Nebut
    META: Metaheuristics and Nature Inspired Computing, Oct 2016, Marrakech, Morocco. <https://meta2016.sciencesconf.org/>
  6. A Graph Constraints Formulation for Contigs Scaffolding
    Eric Bourreau, Annie Chateau, Clément Dallard, Rodolphe Giroudeau
    WCB: Workshop on Constraint-Based Methods for Bioinformatics, Sep 2016, Toulouse, France. pp.136-149.
  7. The sourcing problem: energy optimization of a multisource elevator
    Chloé Desdouits, Mazen Alamir, Rodolphe Giroudeau, Claude Le Pape
    ICINCO 2016 - 13th International Conference on Informatics in Control, Automation and Robotics, Oleg Gusikhin; Dimitri Peaucelle; Kurosh Madani, Jul 2016, Lisbonne, Portugal. pp.19-30.
  8. A Method for the Energy Optimization of a Multisource Elevator
    Chloé Desdouits, Mazen Alamir, Rodolphe Giroudeau, Claude Le Pape
    ICINCO 2016 - 13th International Conference on Informatics in Control, Automation and Robotics, Jul 2016, Lisbonne, Portugal. pp.3-29.
  9. Exploring Accurate Spatial Downscaling using Optimization
    Michael Poss, Didier Josselin
    Spatial Accuracy, Jul 2016, Montpellier, France. <https://colloque.inra.fr/spatial-accuracy2016>
  10. Challenge ROADEF revival
    Eric Bourreau, Brett Choquet, Valentin Pollet
    EURO: European Conference on Operational Research, Jul 2016, Poznan, Poland. <https://euro2016.euro-online.org>
  11. A Model-Driven Approach to Generate Relevant and Realistic Datasets
    Adel Ferdjoukh, Eric Bourreau, Annie Chateau, Clémentine Nebut
    SEKE: Software Engineering and Knowledge Engineering, Jul 2016, Redwood City, San Francisco Bay, United States. pp.105-109.
  12. Resiliency Policies in Access Control Revisited
    Jason Crampton, Gregory Gutin, Rémi Watrigant
    SACMAT: Symposium on Access Control Models and Technologies, Jun 2016, Shanghai, China. pp.101-111.
  13. 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. pp.148-159.
  14. 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. pp.94-97.
  15. Distributed monitoring in 6LoWPAN based Internet of Things
    Basma Mostafa Hassan, Abderrahim Benslimane, Eric Bourreau, Miklós Molnár, Mohamed Saleh
    MoWNeT: Mobile & Wireless Networking, Apr 2016, Cairo, Egypt. pp.1-7.

2015

  1. On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs
    Mathias Weller, Annie Chateau, Rodolphe Giroudeau
    COCOA: Conference on Combinatorial Optimization and Applications, Dec 2015, Houston, United States. pp.409-423.
  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. pp.149-155.
  3. Travelling Salesmen on Bounded Degree Trails
    András Sebő, 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. pp.189-201.
  5. Improved Exact Resolution of Multi-Constrained Path Problem
    Walid Khallef, Sylvain Durand, Miklós Molnár
    t Resolution of Multi-Constrained Path Problem. EURO: European Conference on Operational Research, Jul 2015, Glasgow, United Kingdom. <http://euro2015.euro-online.org/>
  6. Multi-Base strategies to maximize lifetime in Wireless Sensor Network
    Eric Bourreau, Marc Sevaux
    EURO: European Conference on Operational Research, Jul 2015, Glasgow, United Kingdom. <https://euro2015.euro-online.org>
  7. 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. <http://feb.kuleuven.be/mapsp2015/>
  8. 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. pp.208-220.
  9. Instantiation of meta-models constrained with OCL: A CSP approach
    Adel Ferdjoukh, Anne-Elisabeth Baert, Eric Bourreau, Annie Chateau, Remi Coletta, Clémentine Nebut
    MODELSWARD: Model-Driven Engineering and Software Development, Feb 2015, Angers, France. pp.213-222.

2014

  1. Approximation of the Degree-Constrained Minimum Spanning Hierarchies
    Miklós Molnár, Sylvain Durand, Massinissa Merabet
    21th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2014), Jul 2014, Takayama, Japan. pp.96-107.
  2. Complexity and Polynomial-Time Approximation Algorithms around the Scaffolding Problem
    Annie Chateau, Rodolphe Giroudeau
    AlCoB: Algorithms for Computational Biology, Jul 2014, Tarragona, Spain. pp.47-58.
  3. A New Formulation of Degree-Constrained Spanning Problems
    Miklós Molnár, Sylvain Durand, Massinissa Merabet
    ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France. <http://oc.inpg.fr/conf/icgt2014/>
  4. 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.
  5. Coupled-Tasks in Presence of Bipartite Compatibilities Graphs
    Benoit Darties, Gilles Simonin, Rodolphe Giroudeau, Jean-Claude König
    ISCO: International Symposium on Combinatorial Optimization, Mar 2014, Lisbon, Portugal. pp.161-172.
  6. Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs
    Marin Bougeret, Nicolas Bousquet, Rodolphe Giroudeau, Rémi Watrigant
    SOFSEM: Theory and Practice of Computer Science, Jan 2014, Nový Smokovec, Slovakia. pp.150-161.
  7. Light-trail based hierarchy: the optimal multicast route in WDM networks without splitters and converters
    Dinh Danh Le, Massinissa Merabet
    PHOTOPTICS, Jan 2014, Lisbon, Portugal. <http://www.photoptics.org/?y=2014>

Tags

Approximation, Operations research, Networks, Scheduling, Combinatorial optimization, Complexity, Robust optimization, Mathematical programming, Constraint programming

Last update on 19/06/2020