Minoux Michel

Michel Minoux

Information about the author Michel Minoux will soon be added to the site.
Found 14 papers in total
Global probability maximization for a Gaussian bilateral inequality in polynomial time
Global probability maximization for a Gaussian bilateral inequality in polynomial time
2017
The present paper investigates Gaussian bilateral inequalities in view of solving...
Reduced-size formulations for metric and cut polyhedra in sparse graphs
Reduced-size formulations for metric and cut polyhedra in sparse graphs
2017
Given a graph G = ( V , E ) with | V | = n and | E | = m ,...
On 2‐stage robust LP with RHS uncertainty: complexity results and applications
On 2‐stage robust LP with RHS uncertainty: complexity results and applications
2011
We investigate here the class–denoted R‐LP‐RHSU–of...
Solving some multistage robust decision problems with huge implicitly defined scenario trees
Solving some multistage robust decision problems with huge implicitly defined scenario trees
2009
This paper describes models and solution algorithms for solving robust multistage...
A comparison of heuristics for the discrete cost multicommodity network optimization problem
A comparison of heuristics for the discrete cost multicommodity network optimization problem
2003
In this paper, approximate solutions algorithms for discrete cost multicommodity...
An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications
An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications
2003
Algorithms described so far to solve the maximum flow problem on hypergraphs first...
Discrete cost multicommodity network optimization problems and exact solution methods
Discrete cost multicommodity network optimization problems and exact solution methods
2001
We first introduce a generic model for discrete cost multicommodity network...
Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization
Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization
1999
Cell flipping in VLSI design is an operation in which some of the cells are replaced...
A O (n) algorithm for projecting a vector on the intersection of a hyperplane and Rn+
A O (n) algorithm for projecting a vector on the intersection of a hyperplane and Rn+
1997
We present a O ( n ) time algorithm for the projection of a vector on the intersection...
The p-Center-Sum location problem
The p-Center-Sum location problem
1994
A new location-allocation problem, called p-Center-Sum, is considered: given n clients...
Efficient greedy heuristics for Steiner Tree problems using reoptimization and supermodularity
Efficient greedy heuristics for Steiner Tree problems using reoptimization and supermodularity
1990
The optimum Steiner Tree problem in a (nondirected) graph is known to belong to the...
An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
1989
This paper shows how branch-and-bound and column generation techniques can be combined...
Optimal traffic assignment in SS/TDMA frame: A new approach by set covering and column generation
Optimal traffic assignment in SS/TDMA frame: A new approach by set covering and column generation
1986
The paper addresses here the problem of optimal assignment of a given traffic matrix,...
A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
1987
The paper introduces and studies a whole class of combinatorial problems which can be...
Papers per page: