Articles

(2020), The Multiple Steiner TSP with order constraints: complexity and optimization algorithms, Soft Computing

(2020), A robust p-Center problem under pressure to locate shelters in wildfire context, EURO Journal on Computational Optimization, vol. 8, n°2, p. 103-139

(2018), QoS-aware automatic syntactic service composition problem: Complexity and resolution, Future Generation Computer Systems, vol. 80, p. 311-321

(2018), Portfolio optimization with pw-robustness, EURO Journal on Computational Optimization, vol. 6, n°3, p. 267-290

(2017), An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem, Networks, vol. 69, n°1, p. 124-141

(2016), Lower Bounding Techniques for DSATUR-based Branch and Bound, Electronic Notes in Discrete Mathematics, vol. 52, p. 149-156

(2016), Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem, Networks, vol. 67, n°2, p. 148-169

(2015), Web services composition: Complexity and models, Discrete Applied Mathematics, vol. 196, p. 100-114

(2014), Recent advances in robust optimization: An overview, European Journal of Operational Research, vol. 235, n°3, p. 471-483

(2014), Robust location transportation problems under uncertain demands, Discrete Applied Mathematics, vol. 146, n°part 1

(2013), New models for the robust shortest path problem: complexity, resolution and generalization, Annals of Operations Research, vol. 207, n°1, p. 97-120

(2010), Linear Programming with interval right hand sides, International Transactions in Operational Research, vol. 17, n°3, p. 397-408

(2010), Robustness and duality in linear programming, Journal of the Operational Research Society, vol. 61, p. 1288-1296

(2006), Strengthened 0-1 linear formulation for the daily satellite mission planning, Journal of Combinatorial Optimization, vol. 11, n°3, p. 341-346

(2002), Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an Earth observing satellite, European Journal of Operational Research, vol. 139, n°3, p. 533-542

(1997), A new single model and derived algorithms for the satellite shots planning problem using graph theory concepts, Annals of Operations Research, vol. 69, n°0, p. 115-134

Chapitres d'ouvrage

(2010), Robust Shortest Path Problems, in Paschos, Vangelis, Paradigms of Combinatorial Optimization Wiley, p. 704

(2008), Mission planning for observation satellites, in G. Finke, Operations research and networks Wiley-ISTE, p. 352

(2008), An extensive comparison of 0-1 linear programs for the daily satellite mission planning, in Paschos, Vangelis, Combinatorial optimization and theorical computer science: interfaces and perspectives: 30th anniversary of the LAMSADE, Hoboken NJ: Wiley, p. 515

(2008), Dantzig-Wolfe decomposition for linearly constrained stable set problem, in Paschos, Vangelis, Combinatorial optimization and theorical computer science: interfaces and perspectives: 30th anniversary of the LAMSADE, Hoboken NJ: Wiley, p. 515

(2007), Plus courts chemins robustes, in Paschos, Vangelis Th., Optimisation combinatoire 5 : problèmes paradigmatiques et nouvelles problématiques, Paris: Lavoisier, p. 271-XI

(2002), Planification de prises de vue par satellite, in Finke, Gerd, Recherche opérationnelle et réseaux: Méthodes d'analyse spatiale (Traité IGAT, série Aspects fondamentaux de l'analyse spatiale), Paris: Lavoisier, p. 272

Communications avec actes

(2016), MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover, in , Combinatorial Optimization: 4th International Symposium, ISCO 2016, Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers, Springer, 123-134 p.

(2014), Optimal and Automatic Transactional Web Service Composition with Dependency Graph and 0-1 Linear Programming, in Xavier Franch, Aditya K. Ghose, Grace A. Lewis, Sami Bhiri, Service-Oriented Computing. 12th International Conference, ICSOC 2014, Paris, France, November 3-6, 2014. Proceedings, Springer, 108-122 p.

(2012), A new 0–1 linear program for QoS and transactional-aware web service composition, in , 2012 IEEE Symposium on Computers and Communications (ISCC), Cappadoce, IEEE - Institute of Electrical and Electronics Engineers, 845-850 p.

(2011), Multilayer Survivable Optical Network Design, in Voß, Stefan, Network Optimization 5th International Conference, INOC 2011, Hambourg, Springer, 670 p.

(2010), Recourse problem of the 2-stage robust location transportation problem, in , ISCO International Symposium on Combinatorial Optimization, Hammamet, Electronic Notes in Discrete Mathematics, 167-174 p.

(2008), Best and Worst optimum for linear programs with interval right hand sides, in Pham Dinh, Tao, Modelling, Computation and Optimization in Information Systems and Management Sciences. Second International Conference MCO 2008, Metz, France - Luxembourg, September 8-10, 2008. Proceedings, Metz, Springer, 618 p.

Communications sans actes

(2019), Variants of the Robust p-Center problem under Pressure, GEOSAFE2019, Melbourne, Australie

(2019), New mathematical models to locate shelters, 6th Fire Behavior and Fuels International Conference - European Component, Marseille, France

(2015), Bornes inférieures sur un algorithme exact basé sur DSATUR résolvant la coloration, 16e conférence ROADEF 2015, Marseille, France

(2015), Mathematical models for real-world production planning problems with sequence-dependent set-up costs, ROADEF 2015, Marseille, France

(2013), La pw?robustesse : pourquoi un nouveau critère de robustesse et comment l’appliquer ?, 14e Congrès ROADEF 2013, Troyes, France

(2013), Web Services Composition : Complexity and models, XXVI Conference of the European Chapter on Combinatorial Optimisation (ECCO 2013), Paris, France

(2011), Robust Supply Chain Management Problem with Uncertain Demands, Journées de l'optimisation 2011, Montreal, Canada

(2011), La bw-robustesse pour le problème du plus court chemin, ROADEF 2011, Saint Etienne, France

(2010), Design of Multilayer Survivable Optical Networks, ISCO International Symposium on Combinatorial Optimization, Hammamet, Tunisie

(2010), Design of Multilayer Survivable Optical Networks, 24th European Conference on Operational Research, Lisbonne, Portugal

(2010), Integer Programming Formulations for the k-Edge-Connected 3-Hop-Constrained Network Design Problem, 24th European Conference on Operational Research, Lisbonne, Portugal

(2010), Nouvelle approche pour traiter des problèmes linéaires avec seconds membres incertains. Application au problème de transport, Congrès ROADEF 2010, Toulouse, France

(2010), Le problème de conception de réseau fiable avec contrainte de borne, Congrès ROADEF 2010, Toulouse, France

(2010), Le problème de sécurisation multicouche du réseau optique, Congrès ROADEF 2010, Toulouse, France

(2010), Investir sur les réseaux de transport gaziers sans regretter : par quoi commence-t-on ?, Congrès ROADEF 2010, Toulouse, France

(2009), Robust Solutions for Linear Programming, MUGI 2009 European Technical Conference and Courses, Dublin, Irlande

Prépublications / Cahiers de recherche

(2013), A new linear program for QoS-aware web service composition based on complex workflow, Paris, Cahiers du LAMSADE, 9 p.

(2010), Application d’un nouveau critère de robustesse pour le problème du plus court chemin, Paris, Note de recherche du LAMSADE, 61 p.

(2010), A New Bound for Solving the Recourse Problem of the 2-Stage Robust Location Transportation Problem, Note de recherche du LAMSADE, 15 p.

(2008), Robustesse et dualité en programmation linéaire, Paris, Note de recherche du LAMSADE, 26 p.