Optimisation et Planification de Réseaux de Télécommunications. - Michel Minoux (Optimization Techniques, 1975)

Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions. - Alain Billionnet; Michel Minoux (Discret. Appl. Math., 1985)

A heuristic approach to hard constrained shortest path problems. - Celso C. Ribeiro; Michel Minoux (Discret. Appl. Math., 1985)

An Efficient Algorithm for the Transitive Closure and a Linear Worst-Case Complexity Result for a Class of Sparse Graphs. - Brigitte Jaumard; Michel Minoux (Inf. Process. Lett., 1986)

A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities. - Pierre Hansen; Brigitte Jaumard; Michel Minoux (Math. Program., 1986)

LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation. - Michel Minoux (Inf. Process. Lett., 1988)

Finite precision design of FIR digital filters using a convexity property. - Brigitte Jaumard; Michel Minoux; Pierre Siohan (IEEE Trans. Acoust. Speech Signal Process., 1988)

Solving combinatorial problems with combined Min-Max-Min-Sum objective and applications. - Michel Minoux (Math. Program., 1989)

A new algorithm for general matching problems using network flow subproblems. - Réjean Lessard; Jean-Marc Rousseau; Michel Minoux (Networks, 1989)

Networks synthesis and optimum network design problems: Models, solution methods and applications. - Michel Minoux (Networks, 1989)

Optimal matching of convex polygons. - Pedro Cox; Henri Maître; Michel Minoux; Celso C. Ribeiro (Pattern Recognit. Lett., 1989)

Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems. - Michel Minoux; Kamel Barkaoui (Discret. Appl. Math., 1990)

A Polynomial-Time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets. - Kamel Barkaoui; Michel Minoux (Application and Theory of Petri Nets, 1992)

The Unique Horn-Satisfiability Problem and Quadratic Boolean Equations. - Michel Minoux (Ann. Math. Artif. Intell., 1992)

Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results. - J. C. Dodu; T. Eve; Michel Minoux (Numer. Algorithms, 1994)

On some large-scale LP relaxations for the Graph Partitioning Problem and their optimal solutions. - Michel Minoux (Ann. Oper. Res., 1995)

Bideterminants, arborescences and extension of the Matrix-Tree theorem to semirings. - Michel Minoux (Discret. Math., 1997)

Modular model checking of VLSI designs described in VHDL. - Fahim Rahim-Sarwary; Emmanuelle Encrenaz; Michel Minoux; Rajesh K. Bawa (CATA, 1998)

Generation of very large circuits to benchmark the partitioning of FPGA. - Joachim Pistorius; Edmée Legai; Michel Minoux (ISPD, 1999)

Optimal Cell Flipping to Minimize Channel Density in VLSI Design and Pseudo-Boolean Optimization. - Endre Boros; Peter L. Hammer; Michel Minoux; David J. Rader Jr. (Discret. Appl. Math., 1999)

A generalization of the all minors tree theorem to semirings. - Michel Minoux (Discret. Math., 1999)

Exact solution of multicommodity network optimization problems with general step cost functions. - Virginie Gabrel; Arnaud Knippel; Michel Minoux (Oper. Res. Lett., 1999)

PartGen: a generator of very large circuits to benchmark thepartitioning of FPGAs. - Joachim Pistorius; Edmée Legai; Michel Minoux (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2000)

Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods. - Michel Minoux (Ann. Oper. Res., 2001)

A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems. - Virginie Gabrel; Michel Minoux (Oper. Res. Lett., 2002)

A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem. - Virginie Gabrel; Arnaud Knippel; Michel Minoux (J. Heuristics, 2003)

Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems. - Michel Minoux (Discret. Appl. Math., 2004)

Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation. - Pierre Bonami; Michel Minoux (Discret. Optim., 2005)

Multicommodity Network Flow Models and Algorithms in Telecommunications. - Michel Minoux (Handbook of Optimization in Telecommunications, 2006)

Modeling and solving a Crew Assignment Problem in air transportation. - F. M. Zeghal; Michel Minoux (Eur. J. Oper. Res., 2006)

Exact MAX-2SAT solution via lift-and-project closure. - Pierre Bonami; Michel Minoux (Oper. Res. Lett., 2006)

Discrete Monotonic Optimization with Application to a Discrete Location Problem. - Hoang Tuy; Michel Minoux; N. T. Hoai-Phuong (SIAM J. Optim., 2006)

Semirings, Dioids and Their Links to Fuzzy Sets and Other Applications. - Michel Minoux (EUSFLAT Conf. (1), 2007)

Dioïds and semirings: Links to fuzzy sets and other applications. - Michel Gondran; Michel Minoux (Fuzzy Sets Syst., 2007)

Joint optimization of pricing and resource allocation in competitive telecommunications networks. - Mustapha Bouhtou; Guillaume Erbs; Michel Minoux (Networks, 2007)

Solving some Multistage Robust Decision Problems with Huge Implicitly Defined Scenario Trees. - Michel Minoux (Algorithmic Oper. Res., 2009)

Scheduling of loading and unloading of crude oil in a refinery using event-based discrete time formulation. - Georgios K. D. Saharidis; Michel Minoux; Yves Dallery (Comput. Chem. Eng., 2009)

Discrete lot sizing and scheduling using product decomposition into attributes. - Céline Gicquel; N. Miègeville; Michel Minoux; Yves Dallery (Comput. Oper. Res., 2009)

A strong flow-based formulation for the shortest path problem in digraphs with negative cycles. - Mamane Souley Ibrahim; Nelson Maculan; Michel Minoux (Int. Trans. Oper. Res., 2009)

On robust maximum flow with polyhedral uncertainty sets. - Michel Minoux (Optim. Lett., 2009)

On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times. - Céline Gicquel; Michel Minoux; Yves Dallery (Oper. Res. Lett., 2009)

Robust Linear Programming with Right-Hand-Side Uncertainty, Duality and Applications. - Michel Minoux (Encyclopedia of Optimization, 2009)

Maximum Constraint Satisfaction: Relaxations and Upper Bounds. - Michel Minoux; P. Mavrocordatos (Encyclopedia of Optimization, 2009)

Robust network optimization under polyhedral demand uncertainty is NP-hard. - Michel Minoux (Discret. Appl. Math., 2010)

DRL*: A hierarchy of strong block-decomposable linear relaxations for 0-1 MIPs. - Michel Minoux; Hacene Ouzia (Discret. Appl. Math., 2010)

Using DRL* relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut. - Michel Minoux; Hacene Ouzia (Electron. Notes Discret. Math., 2010)

Optimizing glass coating lines: MIP model and valid inequalities. - Céline Gicquel; N. Miègeville; Michel Minoux; Yves Dallery (Eur. J. Oper. Res., 2010)

Accelerating Benders method using covering cut bundle generation. - Georgios K. D. Saharidis; Michel Minoux; Marianthi G. Ierapetritou (Int. Trans. Oper. Res., 2010)

Mixed Integer Programming Model for Pricing in Telecommunication. - Mustapha Bouhtou; Jean-Robin Medori; Michel Minoux (INOC, 2011)

On 2-stage robust LP with RHS uncertainty: complexity results and applications. - Michel Minoux (J. Glob. Optim., 2011)

On the Solution of a Graph Partitioning Problem under Capacity Constraints. - Pierre Bonami; Viet Hung Nguyen; Michel Klein; Michel Minoux (ISCO, 2012)

A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints. - Céline Gicquel; L. Hege; Michel Minoux; W. van Canneyt (Comput. Oper. Res., 2012)

On discrete lot-sizing and scheduling on identical parallel machines. - Céline Gicquel; Laurence A. Wolsey; Michel Minoux (Optim. Lett., 2012)

Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard. - Michel Minoux (Optim. Lett., 2012)

Compact versus noncompact LP formulations for minimizing convex Choquet integrals. - Julien Lesca; Michel Minoux; Patrice Perny (Discret. Appl. Math., 2013)

New Multi-product Valid Inequalities for a Discrete Lot-sizing Problem. - Céline Gicquel; Michel Minoux (ICORES, 2014)

Solving to Optimality a Discrete Lot-Sizing Problem Thanks to Multi-product Multi-period Valid Inequalities. - Céline Gicquel; Michel Minoux (ICORES (Selected Papers), 2014)

A distribution network design problem in the automotive industry: MIP formulation and heuristics. - Mouna Kchaou Boujelben; Céline Gicquel; Michel Minoux (Comput. Oper. Res., 2014)

An evaluation of semidefinite programming based approaches for discrete lot-sizing problems. - Céline Gicquel; Abdel Lisser; Michel Minoux (Eur. J. Oper. Res., 2014)

Two-stage robust optimization, state-space representable uncertainty and applications. - Michel Minoux (RAIRO Oper. Res., 2014)

Multi-product valid inequalities for the discrete lot-sizing and scheduling problem. - Céline Gicquel; Michel Minoux (Comput. Oper. Res., 2015)

Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles. - Mamane Souley Ibrahim; Nelson Maculan; Michel Minoux (Optim. Lett., 2015)

A MILP model and heuristic approach for facility location under multiple operational constraints. - Mouna Kchaou Boujelben; Céline Gicquel; Michel Minoux (Comput. Ind. Eng., 2016)

Convexity of Gaussian chance constraints and of related probability maximization problems. - Michel Minoux; Riadh Zorgati (Comput. Stat., 2016)

Improved compact formulations for metric and cut polyhedra. - Viet Hung Nguyen; Michel Minoux; Dang Phuong Nguyen (Electron. Notes Discret. Math., 2016)

Stochastic graph partitioning: quadratic versus SOCP formulations. - Dang Phuong Nguyen; Michel Minoux; Viet Hung Nguyen; Thanh Hai Nguyen; Renaud Sirdey (Optim. Lett., 2016)

Improved compact formulations for a wide class of graph partitioning problems in sparse graphs. - Dang Phuong Nguyen; Michel Minoux; Viet Hung Nguyen; Thanh Hai Nguyen; Renaud Sirdey (Discret. Optim., 2017)

Global probability maximization for a Gaussian bilateral inequality in polynomial time. - Michel Minoux; Riadh Zorgati (J. Glob. Optim., 2017)

Reduced-size formulations for metric and cut polyhedra in sparse graphs. - Viet Hung Nguyen; Michel Minoux; Dang Phuong Nguyen (Networks, 2017)

Improved linearized models for graph partitioning problem under capacity constraints. - Viet Hung Nguyen; Michel Minoux (Optim. Methods Softw., 2017)

A compact optimization model for the tail assignment problem. - Oumaima Khaled; Michel Minoux; Vincent Mousseau; Stéphane Michel; Xavier Ceugniet (Eur. J. Oper. Res., 2018)

Robust and stochastic multistage optimisation under Markovian uncertainty with applications to production/inventory problems. - Michel Minoux (Int. J. Prod. Res., 2018)

The Fair OWA One-to-One Assignment Problem: NP-Hardness and Polynomial Time Special Cases. - Julien Lesca; Michel Minoux; Patrice Perny (Algorithmica, 2019)

Optimizing resource utilization in NFV dynamic systems: New exact and heuristic approaches. - Thi-Minh Nguyen; Michel Minoux; Serge Fdida (Comput. Networks, 2019)

Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems. - Michel Minoux; Riadh Zorgati (J. Glob. Optim., 2019)

An integer programming model for minimizing energy cost in water distribution system using trigger levels with additional time slots. - David Wu; Viet Hung Nguyen; Michel Minoux; Hai Tran (RIVF, 2021)

Linear size MIP formulation of Max-Cut: new properties, links with cycle inequalities and computational results. - Viet Hung Nguyen; Michel Minoux (Optim. Lett., 2021)

Optimal deterministic and robust selection of electricity contracts. - David Wu; Viet Hung Nguyen; Michel Minoux; Hai Tran (J. Glob. Optim., 2022)