Michel Minoux

Publication Activity (10 Years)

Years Active: 1975-2022
Publications (10 Years): 16

Top Topics

Integer Program

Valid Inequalities

Top Venues

J. Glob. Optim.

Comput. Oper. Res.

Eur. J. Oper. Res.

Publications

David Wu, Viet Hung Nguyen, Michel Minoux, Hai Tran
Optimal deterministic and robust selection of electricity contracts. J. Glob. Optim. 82 (4) (2022)
Viet Hung Nguyen, Michel Minoux
Linear size MIP formulation of Max-Cut: new properties, links with cycle inequalities and computational results. Optim. Lett. 15 (4) (2021)
David Wu, Viet Hung Nguyen, Michel Minoux, Hai Tran
An integer programming model for minimizing energy cost in water distribution system using trigger levels with additional time slots. RIVF (2021)
Julien Lesca, Michel Minoux, Patrice Perny
The Fair OWA One-to-One Assignment Problem: NP-Hardness and Polynomial Time Special Cases. Algorithmica 81 (1) (2019)
Thi-Minh Nguyen, Michel Minoux, Serge Fdida
Optimizing resource utilization in NFV dynamic systems: New exact and heuristic approaches. Comput. Networks 148 (2019)
Michel Minoux, Riadh Zorgati
Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems. J. Glob. Optim. 75 (3) (2019)
Michel Minoux
Robust and stochastic multistage optimisation under Markovian uncertainty with applications to production/inventory problems. Int. J. Prod. Res. 56 (1-2) (2018)
Oumaima Khaled, Michel Minoux, Vincent Mousseau, Stéphane Michel, Xavier Ceugniet
A compact optimization model for the tail assignment problem. Eur. J. Oper. Res. 264 (2) (2018)
Michel Minoux, Riadh Zorgati
Global probability maximization for a Gaussian bilateral inequality in polynomial time. J. Glob. Optim. 68 (4) (2017)
Viet Hung Nguyen, Michel Minoux, Dang Phuong Nguyen
Reduced-size formulations for metric and cut polyhedra in sparse graphs. Networks 69 (1) (2017)
Viet Hung Nguyen, Michel Minoux
Improved linearized models for graph partitioning problem under capacity constraints. Optim. Methods Softw. 32 (4) (2017)
Dang Phuong Nguyen, Michel Minoux, Viet Hung Nguyen, Thanh Hai Nguyen, Renaud Sirdey
Improved compact formulations for a wide class of graph partitioning problems in sparse graphs. Discret. Optim. 25 (2017)
Viet Hung Nguyen, Michel Minoux, Dang Phuong Nguyen
Improved compact formulations for metric and cut polyhedra. Electron. Notes Discret. Math. 52 (2016)
Dang Phuong Nguyen, Michel Minoux, Viet Hung Nguyen, Thanh Hai Nguyen, Renaud Sirdey
Stochastic graph partitioning: quadratic versus SOCP formulations. Optim. Lett. 10 (7) (2016)
Michel Minoux, Riadh Zorgati
Convexity of Gaussian chance constraints and of related probability maximization problems. Comput. Stat. 31 (1) (2016)
Mouna Kchaou Boujelben, Céline Gicquel, Michel Minoux
A MILP model and heuristic approach for facility location under multiple operational constraints. Comput. Ind. Eng. 98 (2016)
Mamane Souley Ibrahim, Nelson Maculan, Michel Minoux
Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles. Optim. Lett. 9 (2) (2015)
Céline Gicquel, Michel Minoux
Multi-product valid inequalities for the discrete lot-sizing and scheduling problem. Comput. Oper. Res. 54 (2015)
Céline Gicquel, Michel Minoux
New Multi-product Valid Inequalities for a Discrete Lot-sizing Problem. ICORES (2014)
Michel Minoux
Two-stage robust optimization, state-space representable uncertainty and applications. RAIRO Oper. Res. 48 (4) (2014)
Mouna Kchaou Boujelben, Céline Gicquel, Michel Minoux
A distribution network design problem in the automotive industry: MIP formulation and heuristics. Comput. Oper. Res. 52 (2014)
Céline Gicquel, Michel Minoux
Solving to Optimality a Discrete Lot-Sizing Problem Thanks to Multi-product Multi-period Valid Inequalities. ICORES (Selected Papers) (2014)
Céline Gicquel, Abdel Lisser, Michel Minoux
An evaluation of semidefinite programming based approaches for discrete lot-sizing problems. Eur. J. Oper. Res. 237 (2) (2014)
Julien Lesca, Michel Minoux, Patrice Perny
Compact versus noncompact LP formulations for minimizing convex Choquet integrals. Discret. Appl. Math. 161 (1-2) (2013)
Céline Gicquel, L. Hege, Michel Minoux, W. van Canneyt
A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints. Comput. Oper. Res. 39 (3) (2012)
Céline Gicquel, Laurence A. Wolsey, Michel Minoux
On discrete lot-sizing and scheduling on identical parallel machines. Optim. Lett. 6 (3) (2012)
Michel Minoux
Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard. Optim. Lett. 6 (7) (2012)
Pierre Bonami, Viet Hung Nguyen, Michel Klein, Michel Minoux
On the Solution of a Graph Partitioning Problem under Capacity Constraints. ISCO (2012)
Mustapha Bouhtou, Jean-Robin Medori, Michel Minoux
Mixed Integer Programming Model for Pricing in Telecommunication. INOC (2011)
Michel Minoux
On 2-stage robust LP with RHS uncertainty: complexity results and applications. J. Glob. Optim. 49 (3) (2011)
Michel Minoux
Robust network optimization under polyhedral demand uncertainty is NP-hard. Discret. Appl. Math. 158 (5) (2010)
Michel Minoux, Hacene Ouzia
DRL*: A hierarchy of strong block-decomposable linear relaxations for 0-1 MIPs. Discret. Appl. Math. 158 (18) (2010)
Georgios K. D. Saharidis, Michel Minoux, Marianthi G. Ierapetritou
Accelerating Benders method using covering cut bundle generation. Int. Trans. Oper. Res. 17 (2) (2010)
Michel Minoux, Hacene Ouzia
Using DRL* relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut. Electron. Notes Discret. Math. 36 (2010)
Céline Gicquel, N. Miègeville, Michel Minoux, Yves Dallery
Optimizing glass coating lines: MIP model and valid inequalities. Eur. J. Oper. Res. 202 (3) (2010)
Mamane Souley Ibrahim, Nelson Maculan, Michel Minoux
A strong flow-based formulation for the shortest path problem in digraphs with negative cycles. Int. Trans. Oper. Res. 16 (3) (2009)
Georgios K. D. Saharidis, Michel Minoux, Yves Dallery
Scheduling of loading and unloading of crude oil in a refinery using event-based discrete time formulation. Comput. Chem. Eng. 33 (8) (2009)
Michel Minoux
On robust maximum flow with polyhedral uncertainty sets. Optim. Lett. 3 (3) (2009)
Céline Gicquel, N. Miègeville, Michel Minoux, Yves Dallery
Discrete lot sizing and scheduling using product decomposition into attributes. Comput. Oper. Res. 36 (9) (2009)
Céline Gicquel, Michel Minoux, Yves Dallery
On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times. Oper. Res. Lett. 37 (1) (2009)
Michel Minoux
Solving some Multistage Robust Decision Problems with Huge Implicitly Defined Scenario Trees. Algorithmic Oper. Res. 4 (1) (2009)
Michel Minoux
Semirings, Dioids and Their Links to Fuzzy Sets and Other Applications. EUSFLAT Conf. (1) (2007)
Mustapha Bouhtou, Guillaume Erbs, Michel Minoux
Joint optimization of pricing and resource allocation in competitive telecommunications networks. Networks 50 (1) (2007)
Michel Gondran, Michel Minoux
Dioïds and semirings: Links to fuzzy sets and other applications. Fuzzy Sets Syst. 158 (12) (2007)
Pierre Bonami, Michel Minoux
Exact MAX-2SAT solution via lift-and-project closure. Oper. Res. Lett. 34 (4) (2006)
F. M. Zeghal, Michel Minoux
Modeling and solving a Crew Assignment Problem in air transportation. Eur. J. Oper. Res. 175 (1) (2006)
Hoang Tuy, Michel Minoux, N. T. Hoai-Phuong
Discrete Monotonic Optimization with Application to a Discrete Location Problem. SIAM J. Optim. 17 (1) (2006)
Pierre Bonami, Michel Minoux
Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation. Discret. Optim. 2 (4) (2005)
Michel Minoux
Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems. Discret. Appl. Math. 144 (1-2) (2004)
Virginie Gabrel, Arnaud Knippel, Michel Minoux
A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem. J. Heuristics 9 (5) (2003)
Virginie Gabrel, Michel Minoux
A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems. Oper. Res. Lett. 30 (4) (2002)
Michel Minoux
Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods. Ann. Oper. Res. 106 (1-4) (2001)
Joachim Pistorius, Edmée Legai, Michel Minoux
PartGen: a generator of very large circuits to benchmark thepartitioning of FPGAs. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19 (11) (2000)
Virginie Gabrel, Arnaud Knippel, Michel Minoux
Exact solution of multicommodity network optimization problems with general step cost functions. Oper. Res. Lett. 25 (1) (1999)
Joachim Pistorius, Edmée Legai, Michel Minoux
Generation of very large circuits to benchmark the partitioning of FPGA. ISPD (1999)
Endre Boros, Peter L. Hammer, Michel Minoux, David J. Rader Jr.
Optimal Cell Flipping to Minimize Channel Density in VLSI Design and Pseudo-Boolean Optimization. Discret. Appl. Math. 90 (1-3) (1999)
Michel Minoux
A generalization of the all minors tree theorem to semirings. Discret. Math. 199 (1-3) (1999)
Fahim Rahim-Sarwary, Emmanuelle Encrenaz, Michel Minoux, Rajesh K. Bawa
Modular model checking of VLSI designs described in VHDL. CATA (1998)
Michel Minoux
Bideterminants, arborescences and extension of the Matrix-Tree theorem to semirings. Discret. Math. 171 (1-3) (1997)
Michel Minoux
On some large-scale LP relaxations for the Graph Partitioning Problem and their optimal solutions. Ann. Oper. Res. 58 (3) (1995)
J. C. Dodu, T. Eve, Michel Minoux
Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results. Numer. Algorithms 6 (2) (1994)
Michel Minoux
The Unique Horn-Satisfiability Problem and Quadratic Boolean Equations. Ann. Math. Artif. Intell. 6 (1-3) (1992)
Kamel Barkaoui, Michel Minoux
A Polynomial-Time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets. Application and Theory of Petri Nets (1992)
Michel Minoux, Kamel Barkaoui
Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems. Discret. Appl. Math. 29 (2-3) (1990)
Michel Minoux
Networks synthesis and optimum network design problems: Models, solution methods and applications. Networks 19 (3) (1989)
Michel Minoux
Solving combinatorial problems with combined Min-Max-Min-Sum objective and applications. Math. Program. 45 (1-3) (1989)
Réjean Lessard, Jean-Marc Rousseau, Michel Minoux
A new algorithm for general matching problems using network flow subproblems. Networks 19 (4) (1989)
Pedro Cox, Henri Maître, Michel Minoux, Celso C. Ribeiro
Optimal matching of convex polygons. Pattern Recognit. Lett. 9 (5) (1989)
Brigitte Jaumard, Michel Minoux, Pierre Siohan
Finite precision design of FIR digital filters using a convexity property. IEEE Trans. Acoust. Speech Signal Process. 36 (3) (1988)
Michel Minoux
LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation. Inf. Process. Lett. 29 (1) (1988)
Brigitte Jaumard, Michel Minoux
An Efficient Algorithm for the Transitive Closure and a Linear Worst-Case Complexity Result for a Class of Sparse Graphs. Inf. Process. Lett. 22 (4) (1986)
Pierre Hansen, Brigitte Jaumard, Michel Minoux
A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities. Math. Program. 34 (2) (1986)
Alain Billionnet, Michel Minoux
Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions. Discret. Appl. Math. 12 (1) (1985)
Celso C. Ribeiro, Michel Minoux
A heuristic approach to hard constrained shortest path problems. Discret. Appl. Math. 10 (2) (1985)
Michel Minoux
Optimisation et Planification de Réseaux de Télécommunications. Optimization Techniques (1975)