# Michel Minoux

According to our database

Collaborative distances:

^{1}, Michel Minoux authored at least 74 papers between 1975 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems.

J. Glob. Optim., 2019

Optimizing resource utilization in NFV dynamic systems: New exact and heuristic approaches.

Comput. Networks, 2019

The Fair OWA One-to-One Assignment Problem: NP-Hardness and Polynomial Time Special Cases.

Algorithmica, 2019

2018

Eur. J. Oper. Res., 2018

2017

Improved linearized models for graph partitioning problem under capacity constraints.

Optim. Methods Softw., 2017

Networks, 2017

Global probability maximization for a Gaussian bilateral inequality in polynomial time.

J. Glob. Optim., 2017

Improved compact formulations for a wide class of graph partitioning problems in sparse graphs.

Discret. Optim., 2017

2016

Optim. Lett., 2016

Electron. Notes Discret. Math., 2016

Convexity of Gaussian chance constraints and of related probability maximization problems.

Comput. Stat., 2016

A MILP model and heuristic approach for facility location under multiple operational constraints.

Comput. Ind. Eng., 2016

2015

Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles.

Optim. Lett., 2015

Multi-product valid inequalities for the discrete lot-sizing and scheduling problem.

Comput. Oper. Res., 2015

2014

Two-stage robust optimization, state-space representable uncertainty and applications.

RAIRO Oper. Res., 2014

An evaluation of semidefinite programming based approaches for discrete lot-sizing problems.

Eur. J. Oper. Res., 2014

A distribution network design problem in the automotive industry: MIP formulation and heuristics.

Comput. Oper. Res., 2014

Solving to Optimality a Discrete Lot-Sizing Problem Thanks to Multi-product Multi-period Valid Inequalities.

Proceedings of the Operations Research and Enterprise Systems, 2014

Proceedings of the ICORES 2014, 2014

2013

Compact versus noncompact LP formulations for minimizing convex Choquet integrals.

Discret. Appl. Math., 2013

2012

Optim. Lett., 2012

Optim. Lett., 2012

A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints.

Comput. Oper. Res., 2012

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

J. Glob. Optim., 2011

Proceedings of the Network Optimization - 5th International Conference, 2011

2010

Int. Trans. Oper. Res., 2010

Eur. J. Oper. Res., 2010

Using DRL* relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut.

Electron. Notes Discret. Math., 2010

Discret. Appl. Math., 2010

Discret. Appl. Math., 2010

2009

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Robust Linear Programming with Right-Hand-Side Uncertainty, Duality and Applications.

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times.

Oper. Res. Lett., 2009

Optim. Lett., 2009

A strong flow-based formulation for the shortest path problem in digraphs with negative cycles.

Int. Trans. Oper. Res., 2009

Comput. Oper. Res., 2009

Scheduling of loading and unloading of crude oil in a refinery using event-based discrete time formulation.

Comput. Chem. Eng., 2009

Solving some Multistage Robust Decision Problems with Huge Implicitly Defined Scenario Trees.

Algorithmic Oper. Res., 2009

2007

Joint optimization of pricing and resource allocation in competitive telecommunications networks.

Networks, 2007

Fuzzy Sets Syst., 2007

Proceedings of the New Dimensions in Fuzzy Logic and Related Technologies. Proceedings of the 5th EUSFLAT Conference, 2007

2006

SIAM J. Optim., 2006

Oper. Res. Lett., 2006

Eur. J. Oper. Res., 2006

Proceedings of the Handbook of Optimization in Telecommunications, 2006

2005

Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation.

Discret. Optim., 2005

2004

Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems.

Discret. Appl. Math., 2004

2003

A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem.

J. Heuristics, 2003

2002

A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems.

Oper. Res. Lett., 2002

2001

Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods.

Ann. Oper. Res., 2001

2000

PartGen: a generator of very large circuits to benchmark thepartitioning of FPGAs.

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2000

1999

Exact solution of multicommodity network optimization problems with general step cost functions.

Oper. Res. Lett., 1999

Discret. Math., 1999

Optimal Cell Flipping to Minimize Channel Density in VLSI Design and Pseudo-Boolean Optimization.

Discret. Appl. Math., 1999

Proceedings of the 1999 International Symposium on Physical Design, 1999

1998

Modular model checking of VLSI designs described in VHDL.

Proceedings of the Computers and Their Applications (CATA-98), 1998

1997

Bideterminants, arborescences and extension of the Matrix-Tree theorem to semirings.

Discret. Math., 1997

1995

On some large-scale LP relaxations for the Graph Partitioning Problem and their optimal solutions.

Ann. Oper. Res., 1995

1994

Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results.

Numer. Algorithms, 1994

1992

Ann. Math. Artif. Intell., 1992

A Polynomial-Time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets.

Proceedings of the Application and Theory of Petri Nets 1992, 1992

1990

Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems.

Discret. Appl. Math., 1990

1989

Pattern Recognit. Lett., 1989

Networks synthesis and optimum network design problems: Models, solution methods and applications.

Networks, 1989

Networks, 1989

Solving combinatorial problems with combined Min-Max-Min-Sum objective and applications.

Math. Program., 1989

1988

IEEE Trans. Acoust. Speech Signal Process., 1988

LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation.

Inf. Process. Lett., 1988

1986

A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities.

Math. Program., 1986

An Efficient Algorithm for the Transitive Closure and a Linear Worst-Case Complexity Result for a Class of Sparse Graphs.

Inf. Process. Lett., 1986

1985

Discret. Appl. Math., 1985

Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions.

Discret. Appl. Math., 1985

1975

Proceedings of the Optimization Techniques: Modeling and Optimization in the Service of Man, Part 1, 1975