Michel Minoux

发表

Programmation Mathématique. Théorie et Algorithmes

Michel Minoux, M. Minoux, Michel Minoux, 2008 .

Optimisation et Planification de Réseaux de Télécommunications

Michel Minoux, 1975, Optimization Techniques.

A New Heuristic Approach to the Minimum Discrete Cost Multicommodity Flow Problem

Michel Minoux, 2002 .

Stochastic graph partitioning: quadratic versus SOCP formulations

Michel Minoux, Renaud Sirdey, Viet Hung Nguyen, 2015, Optimization Letters.

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

Michel Minoux, Céline Gicquel, L. Hege, 2012, Comput. Oper. Res..

Modeling and solving a Crew Assignment Problem in air transportation

Michel Minoux, F. M. Zeghal, M. Minoux, 2006, Eur. J. Oper. Res..

A MIP formulation and heuristic for a dynamic distribution network design problem – Case study in the automotive industry

Michel Minoux, Mouna Kchaou Boujelben, Céline Gicquel, 2015 .

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

Michel Minoux, Mouna Kchaou Boujelben, Céline Gicquel, 2014, Comput. Oper. Res..

A generalization of the all minors tree theorem to semirings

Michel Minoux, 1999, Discret. Math..

A heuristic approach to hard constrained shortest path problems

Celso C. Ribeiro, Michel Minoux, C. Ribeiro, 1985, Discret. Appl. Math..

On combining Exact and Heuristic Solution Methods for Combinatorial Problems: illustration on a Class of Hard Discrete Cost Network Optimization Problems

Michel Minoux, 2002 .

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

Yves Dallery, Michel Minoux, Céline Gicquel, 2009, Oper. Res. Lett..

Optimal matching of convex polygons

Celso C. Ribeiro, Henri Maître, Michel Minoux, 1989, Pattern Recognit. Lett..

Models and Algorithms for Robust PERT Scheduling with Time-Dependent Task Durations

Michel Minoux, 2007 .

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

Michel Minoux, 2009, Encyclopedia of Optimization.

Robust and stochastic multistage optimisation under Markovian uncertainty with applications to production/inventory problems

Michel Minoux, M. Minoux, 2018, International Journal of Production Research.

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

Endre Boros, Peter L. Hammer, Michel Minoux, 1999, Discret. Appl. Math..

On robust maximum flow with polyhedral uncertainty sets

Michel Minoux, M. Minoux, 2009, Optim. Lett..

Polynomial Time Algorithms for Proving or Disproving Commoners Structural Property

Kamel Barkaoui, Michel Minoux, 1988 .

Convexity of Gaussian chance constraints and of related probability maximization problems

Michel Minoux, Riadh Zorgati, 2016, Comput. Stat..

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

Michel Minoux, Céline Gicquel, M. Minoux, 2014, ICORES.

The feasibility program with security constraints and network rearrangement costs - Application to mixed /analogue and digital/ transmission networks

Michel Minoux, Jean-Yves Serreault, 1980 .

Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems

Michel Minoux, M. Minoux, 2004, Discret. Appl. Math..

avec Le programme d'admissibilit6 contraintes de s curit et coots de mutations: application aux r seaux de transmission mixtes (analogiques et num riques)

Michel Minoux, Jean-Yves Serreault, M. Minoux, 1980 .

Optimizing glass coating lines: MIP model and valid inequalities

Yves Dallery, Michel Minoux, Céline Gicquel, 2010, Eur. J. Oper. Res..

Exact MAX-2SAT solution via lift-and-project closure

Michel Minoux, Pierre Bonami, M. Minoux, 2006, Oper. Res. Lett..

On the Solution of a Graph Partitioning Problem under Capacity Constraints

Michel Minoux, Viet Hung Nguyen, Pierre Bonami, 2012, ISCO.

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

Michel Minoux, 1997, Discret. Math..

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

Michel Minoux, J. C. Dodu, T. Eve, 2005, Numerical Algorithms.

Semirings, Dioids and Their Links to Fuzzy Sets and Other Applications

Michel Minoux, 2007, EUSFLAT Conf..

A tight MILP formulation based on multi-product valid inequalities for a lot-sizing problem

Michel Minoux, Celine Gicquel, M. Minoux, 2013, Proceedings of 2013 International Conference on Industrial Engineering and Systems Management (IESM).

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

Michel Minoux, Céline Gicquel, M. Minoux, 2015, Comput. Oper. Res..

Mathematical Programming

Michel Minoux, M. Minoux, 1986 .

On 2-stage robust LP with RHS uncertainty: complexity results and applications

Michel Minoux, M. Minoux, 2011, J. Glob. Optim..

Improved linearized models for graph partitioning problem under capacity constraints

Michel Minoux, Viet Hung Nguyen, 2017, Optim. Methods Softw..

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

Michel Minoux, Nelson Maculan, M. S. Ibrahim, 2009, Int. Trans. Oper. Res..

Global probability maximization for a Gaussian bilateral inequality in polynomial time

Michel Minoux, Riadh Zorgati, 2017, J. Glob. Optim..

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

Kamel Barkaoui, Michel Minoux, 1992, Application and Theory of Petri Nets.

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

Brigitte Jaumard, Michel Minoux, B. Jaumard, 1986, Inf. Process. Lett..

A multi-criteria repair/recovery framework for the tail assignment problem in airlines

Michel Minoux, Oumaima Khaled, Vincent Mousseau, 2018 .

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

Michel Minoux, Virginie Gabrel, Arnaud Knippel, 1999, Oper. Res. Lett..

Finite precision design of FIR digital filters using a convexity property

Brigitte Jaumard, Michel Minoux, Pierre Siohan, 1988, IEEE Trans. Acoust. Speech Signal Process..

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

Michel Minoux, Hacene Ouzia, M. Minoux, 2010, Electron. Notes Discret. Math..

A new algorithm for general matching problems using network flow subproblems

Michel Minoux, Jean-Marc Rousseau, Réjean Lessard, 1989, Networks.

Discrete Monotonic Optimization with Application to a Discrete Location Problem

Michel Minoux, Hoang Tuy, N. T. Hoai-Phuong, 2006, SIAM J. Optim..

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

Patrice Perny, Michel Minoux, Julien Lesca, 2018, Algorithmica.

A supply chain network design problem under flow consolidation constraints

Michel Minoux, Mouna Kchaou Boujelben, Céline Gicquel, 2012 .

Accelerating Benders method using covering cut bundle generation

Marianthi G. Ierapetritou, Michel Minoux, Georgios K. D. Saharidis, 2010, Int. Trans. Oper. Res..

Graphes et algorithmes

Michel Minoux, Michel Gondran, Michel Gondran, 1995 .

Relaxations and Upper Bounds for Maximum Constraint Satisfaction. Application to Frequency Assignment

Michel Minoux, Petros Mavrocordatos, 2001 .

Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods

Michel Minoux, M. Minoux, 2001, Ann. Oper. Res..

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

Kamel Barkaoui, Michel Minoux, M. Minoux, 1990, Discret. Appl. Math..

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

Yves Dallery, Michel Minoux, Georgios K. D. Saharidis, 2009, Comput. Chem. Eng..

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

Michel Minoux, Mouna Kchaou Boujelben, Céline Gicquel, 2016, Comput. Ind. Eng..

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

Michel Minoux, M. Minoux, 1989, Math. Program..

On discrete lot-sizing and scheduling on identical parallel machines

Laurence A. Wolsey, Michel Minoux, Céline Gicquel, 2012, Optim. Lett..

Maximum Constraint Satisfaction: Relaxations and Upper Bounds

Michel Minoux, P. Mavrocordatos, 2009, Encyclopedia of Optimization.

Multicommodity Network Flow Models and Algorithms in Telecommunications

Michel Minoux, M. Minoux, 2006, Handbook of Optimization in Telecommunications.

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

Michel Minoux, M. Minoux, 1988, Inf. Process. Lett..

The Unique Horn-Satisfiability problem and quadratic Boolean equations

Michel Minoux, M. Minoux, 1992, Annals of Mathematics and Artificial Intelligence.

Generation of very large circuits to benchmark the partitioning of FPGA

Michel Minoux, Joachim Pistorius, Edmée Legai, 1999, ISPD '99.

Optimization of Content Caching in Content-Centric Network

Serge Fdida, Michel Minoux, Tuan-Minh Pham, 2017 .

Modular model checking of VLSI designs described in VHDL

Emmanuelle Encrenaz-Tiphène, Michel Minoux, Rajesh K. Bawa, 1998, CATA.

New Multi-product Valid Inequalities for a Discrete Lot-sizing Problem

Michel Minoux, Céline Gicquel, M. Minoux, 2014, ICORES.

Robust network optimization under polyhedral demand uncertainty is NP-hard

Michel Minoux, M. Minoux, 2010, Discret. Appl. Math..

Improved compact formulations for metric and cut polyhedra

Michel Minoux, Viet Hung Nguyen, Dang Phuong Nguyen, 2016, Electron. Notes Discret. Math..

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

Pierre Hansen, Brigitte Jaumard, Michel Minoux, 1986, Math. Program..

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

Michel Minoux, M. Minoux, 1995, Ann. Oper. Res..

Solving exactly the Discrete Cost Flow Problem

Michel Minoux, Virginie Gabrel, Arnaud Knippel, 2002 .

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

Michel Minoux, Renaud Sirdey, Viet Hung Nguyen, 2017, Discret. Optim..

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

Michel Minoux, Abdel Lisser, Céline Gicquel, 2014, Eur. J. Oper. Res..

Dioïds and semirings: Links to fuzzy sets and other applications

Michel Minoux, Michel Gondran, M. Gondran, 2007, Fuzzy Sets Syst..

Repair/recovery of the territory assignment problem

Michel Minoux, Vincent Mousseau, Oumaima Khaled, 2016 .

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

Michel Minoux, Riadh Zorgati, M. Minoux, 2019, J. Glob. Optim..

The p-center sum location problem

Michel Minoux, Martine Labbé, Pierre Hansen, 1994 .

Exploring the impact of renewables on supply-demand balance: a probabilistic model

Michel Minoux, Riadh Zorgati, M. Minoux, 2018, 2018 IEEE International Conference on Probabilistic Methods Applied to Power Systems (PMAPS).

Accelerated greedy algorithms for maximizing submodular set functions

Michel Minoux, M. Minoux, 1978 .

Reduced-size formulations for metric and cut polyhedra in sparse graphs

Michel Minoux, Viet Hung Nguyen, Dang Phuong Nguyen, 2017, Networks.

Optimum Network Design Models and Algorithms in Transportation and Communication

Michel Minoux, 2003 .

New formulation for the SONET/SDH network design problem

Michel Minoux, Viet Hung Nguyen, 2006 .

Joint optimization of pricing and resource allocation in competitive telecommunications networks

Michel Minoux, Mustapha Bouhtou, Guillaume Erbs, 2007, Networks.

Graphs, dioids and semirings : new models and algorithms

Michel Minoux, Michel Gondran, M. Gondran, 2008 .

A compact optimization model for the tail assignment problem

Michel Minoux, Vincent Mousseau, Oumaima Khaled, 2018, Eur. J. Oper. Res..

Network Optimisation with Step-Increasing Cost Functions: Approximate Algorithms and LP-Based Lower Bounds

Michel Minoux, Virginie Gabrel, Arnaud Knippel, 1998 .

Discrete lot sizing and scheduling using product decomposition into attributes

Yves Dallery, Michel Minoux, Céline Gicquel, 2009, Comput. Oper. Res..

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

Alain Billionnet, Michel Minoux, A. Billionnet, 1985, Discret. Appl. Math..

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

Michel Minoux, Virginie Gabrel, 2002, Oper. Res. Lett..

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

Michel Minoux, Virginie Gabrel, Arnaud Knippel, 2003, J. Heuristics.

Compact versus noncompact LP formulations for minimizing convex Choquet integrals

Patrice Perny, Michel Minoux, Julien Lesca, 2013, Discret. Appl. Math..

Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard

Michel Minoux, M. Minoux, 2012, Optim. Lett..

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

Michel Minoux, M. Minoux, 2009, Algorithmic Oper. Res..

Preface for advanced discrete optimization techniques for VLSI layout problems

Michel Minoux, Alan J. Hoffman, Anthony Vannelli, 1999 .

Graphs and Algorithms

Michel Minoux, Steven Vajda, Michel Gondran, 1984 .

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

Michel Minoux, M. Minoux, 1989, Networks.

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

Serge Fdida, Michel Minoux, Thi-Minh Nguyen, 2019, Comput. Networks.

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

Michel Minoux, Nelson Maculan, Mamane Souley Ibrahim, 2015, Optim. Lett..

Mixed Integer Programming Model for Pricing in Telecommunication

Michel Minoux, Mustapha Bouhtou, Jean-Robin Medori, 2011, INOC.

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

Michel Minoux, Joachim Pistorius, Edmée Legai, 2000, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

SOP : A DECISION-AID TOOL FOR GLOBAL AIR TRAFFIC MANAGEMENT SYSTEM OPTIMISATION

Michel Minoux, Jim Lambert, Antoine Joubert, 2002 .

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

Michel Minoux, M. Minoux, 2014, RAIRO Oper. Res..

DRL*: A hierarchy of strong block-decomposable linear relaxations for 0-1 MIPs

Michel Minoux, Hacene Ouzia, 2010, Discret. Appl. Math..

Optimal deterministic and robust selection of electricity contracts

Michel Minoux, Viet Hung Nguyen, David Wu, 2021 .

Linear size MIP formulation of Max-Cut: new properties, links with cycle inequalities and computational results

Michel Minoux, Viet Hung Nguyen, 2021, Optim. Lett..

An integer programming model for minimizing energy cost in water distribution system using trigger levels with additional time slots

Michel Minoux, David Wu, Hai Tran, 2021, 2021 RIVF International Conference on Computing and Communication Technologies (RIVF).

Joint optimization of pricing and resource allocation in competitive telecommunications networks

Michel Minoux, Mustapha Bouhtou, Guillaume Erbs, 2007 .

Optimal Cell Ipping to Minimize Channel Density in Vlsi Design and Pseudo-boolean Optimization 1

Peter L. Hammer, Michel Minoux, David J. Rader, 1998 .

Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources

Yves Dallery, Michel Minoux, Céline Gicquel, 2011 .

Network Synthesis and Dynamic Network Optimization

Michel Minoux, M. Minoux, 1987 .

A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$

Michel Minoux, Nelson Maculan, Gérard Plateau, 1997 .

Duality, Robustness and 2-Stage Robust LP Decision Models. Application to Robust PERT Scheduling

Michel Minoux, 2008 .

Robust LP with Right-Handside Uncertainty, Duality and Applications

Michel Minoux, 2007 .

A tight MIP formulation for the Discrete Lot-sizing and Scheduling problem with parallel resources

Yves Dallery, Michel Minoux, Celine Gicquel, 2009, 2009 International Conference on Computers & Industrial Engineering.

Pricing and Resource Allocation for Point-to-Point Telecommunication Services in a Competitive Market: A Bilevel Optimization Approach

Michel Minoux, Mustapha Bouhtou, Guillaume Erbs, 2006 .

A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems

Celso C. Ribeiro, Michel Minoux, C. Ribeiro, 1984 .