Michel Minoux

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