12 PhD graduated 1999 - 2017

1998-2021 Publications

• 2021
  • D. Wu, V. Nguyen, M. Minoux, H. Tran : “Optimal deterministic and robust selection of electricity contracts”, Journal of Global Optimization, (Springer Verlag) (2021)
• 2020
  • V. Nguyen, M. Minoux : “Linear size MIP formulation of Max-Cut: new properties, links with cycle inequalities and computational results”, Optimization Letters, (Springer Verlag) (2020)
• 2019
  • Th. Nguyen, M. Minoux, S. Fdida : “Optimizing resource utilization in NFV dynamic systems: New exact and heuristic approaches”, Computer Networks, vol. 148, pp. 129-141, (Elsevier) (2019)
• 2018
  • O. Khaled, V. Mousseau, M. Minoux, X. Ceugniet, M. Stéphane : “A compact optimization model for the tail assignment problem”, European Journal of Operational Research, vol. 264 (2), pp. 548-557, (Elsevier) (2018)
  • J. Lesca, M. Minoux, P. Perny : “The Fair OWA One-to-one Assignment Problem: NP-hardness and Polynomial Time Special Cases.”, Algorithmica, (Springer Verlag) (2018)
• 2017
  • M. Minoux : “Robust and stochastic multistage optimisation under Markovian uncertainty with applications to production/inventory problems”, International Journal of Production Research, vol. 56 (1-2), pp. 565-583, (Taylor & Francis) (2017)
  • T.‑M. Pham, M. Minoux, S. Fdida, M. Pilarski : “Optimization of Content Caching in Content-Centric Network”, (2017)
  • M. Minoux, R. Zorgati : “Global probability maximization for a gaussian bilateral inequality in polynomial time”, Journal of Global Optimization, (Springer Verlag) (2017)
  • M. Minoux : “A class of efficiently solvable multistage optimization problems under uncertainty and applications”, IMA Journal of Management Mathematics, vol. 28 (1), pp. 87-107, (Oxford University Press (OUP)) (2017)
• 2016
  • D. Nguyen, M. Minoux, V. Nguyen, Th. Nguyen, R. Sirdey : “Stochastic graph partitioning: quadratic versus SOCP formulations”, Optimization Letters, vol. 10 (7), pp. 1505–1518, (Springer Verlag) (2016)
  • V. Nguyen, M. Minoux, D. Nguyen : “Improved compact formulations for metric and cut polyhedra”, Electronic Notes in Discrete Mathematics, vol. 52, pp. 125-132, (Elsevier) (2016)
  • D. Nguyen, M. Minoux, V. Nguyen, Th. Nguyen, R. Sirdey : “Improved compact formulations for a wide class of graph partitioning problems in sparse graphs”, Discrete Optimization, (Elsevier) (2016)
  • M. Minoux, R. Zorgati : “Convexity of Gaussian chance constraints and of related probability maximization problems”, Computational Statistics, vol. 31 (1), pp. 387-408, (Springer Verlag) (2016)
  • M. Boujelben, C. Gicquel, M. Minoux : “A MILP model and heuristic approach for facility location under multiple operational constraints”, Computers & Industrial Engineering, vol. 96, pp. 446-461, (Elsevier) (2016)
  • V. Nguyen, M. Minoux : “Improved linearized models for Graph Partitioning Problem under Capacity Constraints”, Optimization Methods and Software, (Taylor & Francis) (2016)
  • V. Nguyen, M. Minoux, D. Nguyen : “Reduced-size formulations for metric and cut polyhedra in sparse graphs”, Networks, (Wiley) (2016)
  • M. Minoux : “Robust Two-Stage and Multistage Optimization: Complexity Issues and Applications’”, chapter in Handbook of Research on Modern Optimization Algorithms and Applications in Engineering and Economics', pp. 55-95 (2016)
• 2015
  • M. Kchaou Boujelben, C. Gicquel, M. Minoux : “A MIP formulation and heuristic for a dynamic distribution network design problem – Case study in the automotive industry”, European Chapter on Combinatorial Optimization, Catania, Italy (2015)
  • V. Nguyen, M. Minoux, D. Nguyen : “Improved compact formulations for metric and cut polyhedra”, 7^th International Network Optimization Conference, INOC 2015, Warsaw, Poland (2015)
  • C. Gicquel, M. Minoux : “Multi-product valid inequalities for the discrete lot-sizing and scheduling problem”, Computers and Operations Research, vol. 54, pp. 12-20, (Elsevier) (2015)
  • W. VAN ACKOOIJ, M. Minoux : “A characterization of the subdifferential of singular gaussian distribution functions”, Set-Valued and Variational Analysis, vol. 23 (3), pp. 465-483, (Springer) (2015)
  • I. Mamane Souley, N. Maculan, M. Minoux : “Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles”, Optimization Letters, vol. 9 (2), pp. 345-357, (Springer Verlag) (2015)
• 2014
  • M. Kchaou Boujelben, C. Gicquel, M. Minoux : “A distribution network design problem in the automotive industry: MIP formulation and heuristics”, Computers and Operations Research, vol. 52, pp. 16-28, (Elsevier) (2014)
  • C. Gicquel, A. Lisser, M. Minoux : “An evaluation of semidefinite programming based approaches for discrete lot-sizing problems”, European Journal of Operational Research, vol. 237 (2), pp. 498-507, (Elsevier) (2014)
  • M. Ibrahim, N. Maculan, M. Minoux : “A note on the NP-hardness of the separation problem on some valid inequalities for the elementary shortest path problem”, Pesquisa Operacional, vol. 34 (1), pp. 117-124, (Sociedade Brasileira de Pesquisa Operacional) (2014)
  • C. Gicquel, M. Minoux : “New multi-product valid inequalities for a discrete lot-sizing problem”, 3^rd International Conference on Operations Research and Entreprise Systems, Angers, France (2014)
  • M. Minoux : “Two-stage robust optimization, state-space representable uncertainty and applications”, RAIRO - Operations Research, vol. 48 (4), pp. 455-475, (EDP Sciences) (2014)
• 2013
  • C. Gicquel, M. Minoux : “A tight MILP formulation based on multi-product valid inequalities for a lot-sizing problem”, International Conference on Industrial Engineering and Systems Management, Rabat, Morocco, pp. 778 (2013)
  • C. Gicquel, M. Minoux : “Multi-product valid inequalities for the DLSP with sequence-dependent changeover costs”, International Workshop on Lot Sizing (ILWS 2013), Bruxelles, Belgium (2013)
  • M. Kchaou Boujelben, C. Gicquel, M. Minoux : “Conception d’un réseau logistique avec contraintes de volume minimum : une heuristique basée sur la relaxation linéaire”, 14^e congrès de la Société Français de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2013), Troyes, France (2013)
  • C. Gicquel, M. Minoux : “Une nouvelle famille d’inégalités valides pour un problème de dimensionnement de lots avec politique de production discrète”, 14^e congrès de la Société française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2013), Troyes, France (2013)
  • J. Lesca, M. Minoux, P. Perny : “Compact versus Noncompact LP Formulations for minimizing Convex Choquet Integrals”, Discrete Applied Mathematics, vol. 161 (1-2), pp. 184-199, (Elsevier) (2013)
• 2012
  • M. Kchaou Boujelben, C. Gicquel, M. Minoux : “A supply chain network design problem under flow consolidation constraints”, Proceedings of MOSIM'12, Bordeaux, France (2012)
  • C. Gicquel, A. Lisser, M. Minoux : “Tight lower bounds by semidefinite relaxation for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs”, Proceedings of MOSIM'12, Bordeaux, France (2012)
  • P. Bonami, V. Nguyen, M. Klein, M. Minoux : “On the Solution of a Graph Partitioning Problem under Capacity Constraints”, Proceedings of ISCO 2012, vol. 7422, Lecture Notes in Computer Science, Athens, Greece, pp. 285-296 (2012)
  • C. Gicquel, L. Hege, M. Minoux, W. Van Canneyt : “A Discrete Time Exact Solution Approach for a Complex Hybrid Flowshop Scheduling Problem with limited Wait Constraints”, Computers and Operations Research, vol. 39 (3), pp. 629-636, (Elsevier) (2012)
  • C. Gicquel, L. Wolsey, M. Minoux : “On Discrete Lot Sizing and Scheduling on Identical Parallel Machines”, Optimization Letters, vol. 6, pp. 545-557, (Springer Verlag) (2012)
• 2011
  • M. Bouhtou, J.‑R. Medori, M. Minoux : “Mixed Integer Programming model for pricing in telecommunication”, INOC 2011 - 5^th International Network Optimization Conference, vol. 6701, Lecture Notes in Computer Science, Hambourg, Germany, pp. 626-630, (Springer) (2011)
  • M. Minoux : “On Two-Stage Robust LP with RHS Uncertainty: Complexity Results and Applications”, Journal of Global Optimization, vol. 49 (3), pp. 521-537, (Springer Verlag) (2011)
  • C. Gicquel, M. Minoux, Y. Dallery : “Exact solution approaches for the discrete lot-sizing and scheduling problem with identical parallel resources”, International Journal of Production Research, vol. 49 (9), pp. 2587 – 2603, (Taylor & Francis) (2011)
  • M. Bouhtou, J.‑R. Medori, M. Minoux : “Un modèle de Programmation Mixte pour la tarification des télécommunications”, 13^es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), Cap Estérel, France (2011)
• 2010
  • M. Minoux, H. Ouzia : “DRL*: A Hierarchy of Strong Block-Decomposable Linear Relaxations for 0-1 MIPs”, Discrete Applied Mathematics, vol. 158 (18), pp. 2031-2048, (Elsevier) (2010)
  • M. Minoux, H. Ouzia : “Using DRL* relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut”, Electronic Notes in Discrete Mathematics, vol. 36, pp. 1217-1224, (Elsevier) (2010)
  • C. Gicquel, N. Miègeville, M. Minoux, Y. Dallery : “Optimizing Glass Coating Lines: MIP Models and Valid Inequalities”, European Journal of Operational Research, vol. 202 (3), pp. 747-755, (Elsevier) (2010)
  • G. Saharidis, M. Minoux, M. Ierapetritou : “Accelerating Benders Method Using Covering Cut Bundle Generation”, International Transactions in Operational Research, vol. 17 (2), pp. 221-237, (Wiley) (2010)
  • M. Minoux : “Robust Network Optimization under Polyhedral Demand Uncertainty is NP-Hard”, Discrete Applied Mathematics, vol. 158 (5), pp. 597-603, (Elsevier) (2010)
• 2009
  • C. Gicquel, N. Miègeville, M. Minoux, Y. Dallery : “Discrete Lot Sizing and Scheduling using Product Decomposition into Attributes”, Computers and Operations Research, vol. 36 (9), pp. 2690-2698, (Elsevier) (2009)
  • G. Saharidis, M. Minoux, Y. Dallery : “Scheduling of Loading and Unloading of Crude Oil in a Refinery Using Event-Based Discrete-Time Formulation”, Computers & Chemical Engineering, vol. 33 (8), pp. 1413-1426, (Elsevier) (2009)
  • C. Gicquel, M. Minoux, Y. Dallery, J. ‑M. Blondeau : “A Tight MIP Formulation for the Discrete Lot Sizing and Scheduling Problem with Sequence-Dependent Changeover Costs and Times”, Computers & Industrial Engineering, 2009. CIE 2009. International Conference on, Troyes, France, pp. 1-6 (2009)
  • M. Minoux : “On Robust Maximum Flow with Polyhedral Uncertainty Sets”, Optimization Letters, vol. 3 (3), pp. 367-376, (Springer Verlag) (2009)
  • C. Gicquel, M. Minoux, Y. Dallery : “On the Discrete Lot-Sizing and Scheduling Problem with Sequence-Dependent Changeover Time”, Operations Research Letters, vol. 37 (1), pp. 32-36, (Elsevier) (2009)
  • M. Minoux : “Robust Linear Programming with Right-Handside Uncertainty, Duality and Applications”, chapter in Encyclopedia of Optimization, pp. 3317-3327, (Springer), (ISBN: 978-0-387-74758-3) (2009)
  • M. Minoux : “Solving some Multistage Robust Decision Problems with Huge Implicitly defined Scenario Trees”, Algorithmic Operations Research, vol. 4 (1), pp. 1-18, (Preeminent Academic Facets) (2009)
• 2008
  • M. Minoux, H. Ouzia : “On Connections between RLT and Lift-and-Project Relaxations for Ranks 2 and more”, INFORMS annual meeting, Washington, United States (2008)
  • M. Minoux : “Closures of disjunctive relaxations and valid inequalities for mixed integer problems and applications”, Modelling, Computation and Optimization in Information Systems and Management Sciences, Metz, France (2008)
  • M. Minoux : “L’algorithme CCB : comment améliorer l’efficacité de la méthode de Benders”, Journées Polyèdres et Optimisation Combinatoire, Rouen, France, pp. 35-35 (2008)
  • C. Gicquel, M. Minoux, Y. Dallery : “Capacitated Lot Sizing models: a literature review”, (2008)
  • M. Minoux, M. Gondran : “Graphs, Dioids and Semirings. New Models and Algorithms”, vol. 41, Operations Research/Computer Science Interfaces Series, (Springer), (ISBN: 978-0-387-75449-9) (2008)
  • M. Minoux : “Programmation Mathématique. Théorie et Algorithmes”, (Lavoisier), (ISBN: 978-2-7430-1000-3) (2008)
• 2007
  • M. Minoux : “Duality, Robustness, and 2-stage robust LP decision models. Application to Robust PERT Scheduling”, (2007)
  • M. Gondran, M. Minoux : “Dioïds and Semirings: Links to Fuzzy Sets and other Applications”, Fuzzy Sets and Systems, vol. 158 (12), pp. 1273-1294, (Elsevier) (2007)
  • M. Bouhtou, G. Erbs, M. Minoux : “Joint Optimization of Pricing and Resource Allocation in Competitive Telecommunication Networks”, Networks, vol. 50 (1), pp. 37-49, (Wiley) (2007)
  • M. Minoux : “Models and Algorithms for Robust PERT Scheduling with Time-Dependent Task Durations”, Vietnam Journal of Mathematics, vol. 35 (4), pp. 387-398, (Springer) (2007)
• 2006
  • F. Zeghal Mansour, M. Minoux : “Modeling and Solving A Crew Assignment Problem in Air Transportation”, European Journal of Operational Research, vol. 175 (1), pp. 187-209, (Elsevier) (2006)
  • P. Bonami, M. Minoux : “Exact MAX-2SAT solution via lift-and-project closure”, Operations Research Letters, vol. 34 (4), pp. 387-393, (Elsevier) (2006)
  • V. Nguyen, M. Minoux : “New formulation for the SONET/SDH network design problem”, 7^e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2006), Lille, France (2006)
  • T. Hoang, M. Minoux, Th. Nguyen : “Discrete Monotonic Optimization with Application to a Discrete Location Problem”, SIAM Journal on Optimization, vol. 17 (1), pp. 78-97, (Society for Industrial and Applied Mathematics) (2006)
  • P. Bonami, M. Minoux : “Multicommodity Network Flow Models and Algorithms in Telecommunications”, chapter in Handbook of Optimization in Telecommunications, pp. 163-184, (Kluwer Acad Publ.), (ISBN: 978-0-387-30662-9) (2006)
  • M. Minoux, G. Erbs, M. Bouhtou : “Pricing and Resource Allocationfor Point-to-Point Telecommunication Services in a Competitive Market: Bilevel Optimization Approach”, chapter in Telecommunication Planning : Innovations in Pricing, Network Design and Management, vol. 33, Operations Research/Computer Science Interfaces Series, pp. 1-16, (Springer-Verlag), (ISBN: 978-0-387-29222-9) (2006)
  • M. Minoux, P. Bonami : “Une comparaison de quelques méthodes de génération d’inégalités valides pour des problèmes entiers 0-1 généraux”, chapitre de Optimisation Combinatoire 3 : applications, (Hermès) (2006)
• 2005
  • P. Bonami, M. Minoux : “Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation”, Discrete Optimization, vol. 2 (4), pp. 288-307, (Elsevier) (2005)
• 2004
  • M. Minoux : “Polynomial Approximation Schemes and Exact Algorithms for Optimum Curve Segmentation Problems”, Discrete Applied Mathematics, vol. 144 (1-2), pp. 158-172, (Elsevier) (2004)
  • M. Minoux : “La conception optimale de réseaux de télécommunications”, chapter in Méthodes exactes d'analyse de performances de réseaux, Traité IC2, pp. 227-258, (Editions Hermès), (ISBN: 2746208806) (2004)
• 2003
  • V. Gabrel, A. Knippel, M. Minoux : “A comparison of heuristic for the discrete cost multicommodity network optimization problem”, Journal of Heuristics, vol. 9 (5), pp. 429-445, (Springer Verlag) (2003)
  • V. Gabrel, A. Knippel, M. Minoux : “Etude comparative d’heuristiques pour la résolution du problème de dimensionnement de réseaux de télécomunications avec coûts discrets”, 5^e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2003), Avignon, France (2003)
  • P. Bonami, M. Minoux : “Utilisation d’inégalités conditionnellement valides en PLNE 0-1”, 5^e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2003), Avignon, France (2003)
  • M. Minoux, J. Pistorius : “An Improved Direct Labeling Method for the Max-Flow-Min-Cut Computation in Large Hypergraphs, and Applications”, International Transactions in Operational Research, vol. 10 (1), pp. 1-11, (Wiley) (2003)
  • M. Minoux : “Optimum Network Design Models and Algorithms in Transportation and Communication”, International Journal of Logistics Research and Applications, vol. 6 (1-2), pp. 5-15, (Taylor & Francis (Routledge)) (2003)
• 2002
  • M. Minoux : “A New Heuristic Approach to the Minimum Discrete Cost Multicommodity Flow Problem”, INFORMS meeting, San Jose, CA, United States (2002)
  • V. Gabrel, M. Minoux : “A Scheme for Exact Separation of Extended Cover Inequalities and Application to Multidimensional Knapsack Problems”, Operations Research Letters, vol. 30 (4), pp. 252-264, (Elsevier) (2002)
  • M. Minoux : “On combining Exact and Heuristic Solution Methods for Combinatorial Problems: illustration on a Class of Hard Discrete Cost Network Optimization Problems”, ECCO XV, Lugano, Switzerland (2002)
  • A. Knippel, V. Gabrel, M. Minoux : “Solving exactly the Discrete Cost Flow Problem”, International Symposium on Combinatorial Optimization, Paris, France (2002)
  • Th. Champougny, A. Duchêne, A. Joubert, J. Lambert, M. Minoux : “SOP: a Decision-Aid Tool for Global Air Traffic Management System Optimization”, Air traffic control quarterly : an international journal of engineering and operations, vol. 10 (2), pp. 131-145, (Air Traffic Control Association Institute.(ATCA)) (2002)
• 2001
  • M. Minoux : “Extension of MacMahon’s Master Theorem to Pre-Semirings”, Linear Algebra and its Applications, vol. 338 (1-3), pp. 19-26, (Elsevier) (2001)
  • M. Minoux : “Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods”, Annals of Operations Research, vol. 106 (1-4), pp. 19-46, (Springer Verlag) (2001)
  • A. Knippel, V. Gabrel, M. Minoux : “Approximate solutions for hard network design problems”, EURO2001, Rotterdam, Netherlands (2001)
  • M. Minoux : “Graphes, Dioides et Semi-Anneaux: Nouveaux modèles et algorithmes.”, (TEC and DOC), (ISBN: 2-7430-0489-4) (2001)
  • M. Minoux, P. Mavrocordatos : “Relaxations and Upper Bounds for Maximum Constraint Satisfaction. Application to Frequency Assignment”, chapter in Encyclopedia of Optimization, pp. 1325-1335, (Kluwer), (ISBN: 978-0-7923-6932-5) (2001)
• 2000
  • J. Pistorius, E. Legai, M. Minoux : “PartGen: a Generator of Very Large Circuits to Benchmark the Partitioning of FPGAs”, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 19 (11), pp. 1314-1321, (IEEE) (2000)
  • A. Knippel, V. Gabrel, M. Minoux : “Résolution exacte de problèmes d’optimisation de réseaux résistant aux pannes”, AlgoTel 2000 - 2^es Rencontres Françaises sur les Aspects Algorithmiques des Télécommunications, La Rochelle, France (2000)
  • V. Gabrel, A. Knippel, M. Minoux : “Solution exacte aux problèmes de multiflots avec fonctions de coût en escalier”, 3^e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2000), Nantes, France (2000)
  • M. Gondran, M. Minoux : “Dioides et Semi-Anneaux : Algèbre et Analyses pour le XXIe siècle ?”, Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, vol. 19 (1-3), pp. 253-262, (Lavoisier) (2000)
• 1999
  • V. Gabrel, A. Knippel, M. Minoux : “Exact Solution of Multicommodity Network Optimization Problems with General Step Cost Functions”, Operations Research Letters, vol. 25 (1), pp. 15-23, (Elsevier) (1999)
  • M. Minoux : “A Generalization of the All Minors Matrix Tree Theorem to Semirings”, Discrete Mathematics, vol. 199 (1-3), pp. 139-150, (Elsevier) (1999)
  • V. Gabrel, A. Knippel, M. Minoux : “Heuristiques pour le problème du multiflot à coût minimum avec fonctions de coût en escalier”, 2^e Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 1999), Autrans, France (1999)
  • E. Boros, Peter L. Hammer, M. Minoux, D. Rader : “Optimal Cell-Flipping to Minimize Channel Density in VLSI Design and Pseudo-Boolean Optimization”, Discrete Applied Mathematics, vol. 90 (1-3), pp. 69-88, (Elsevier) (1999)
• 1998
  • M. Minoux : “Algèbre linéaire dans les semi-anneaux et les dioïdes”, (1998)
  • M. Minoux : “Propriétés combinatoires des matrices sur les (pré)-semi-anneaux”, (1998)
  • M. Minoux : “Résolution de systèmes linéaires dans les semi-anneaux et les dioïdes”, (1998)
  • M. Gondran, M. Minoux : “Eigenvalues and Eigenfunctionals of Diagonally Dominant Endomorphisms in Min-Max Analysis”, Linear Algebra and its Applications, vol. 282 (1-3), pp. 47-61, (Elsevier) (1998)
  • A. Knippel, V. Gabrel, M. Minoux : “Network Optimisation with Step-Increasing Cost Functions: Approximate Algorithms and LP-Based Lower Bounds”, Computational Engineering in Systems Applications - IMACS Multiconference, Nabeul-Hammamet, Tunisia (1998)
  • F. Rahim, E. Encrenaz, M. Minoux, Rajesh K. Bawa : “Modular Model Checking of VLSI Designs described in VHDL”, IEEE International Conference on Computer and their Applications, Honolulu, Hawai, United States, pp. 365-368 (1998)