| 2009 |
|---|
| 26 | EE | Michel Minoux,
P. Mavrocordatos:
Maximum Constraint Satisfaction: Relaxations and Upper Bounds.
Encyclopedia of Optimization 2009: 1981-1991 |
| 25 | EE | Michel Minoux:
Robust Linear Programming with Right-Hand-Side Uncertainty, Duality and Applications.
Encyclopedia of Optimization 2009: 3317-3327 |
| 24 | EE | 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): 32-36 (2009) |
| 2007 |
|---|
| 23 | EE | Michel Minoux:
Semirings, Dioids and Their Links to Fuzzy Sets and Other Applications.
EUSFLAT Conf. (1) 2007: 25-25 |
| 22 | EE | Michel Gondran,
Michel Minoux:
Dioïds and semirings: Links to fuzzy sets and other applications.
Fuzzy Sets and Systems 158(12): 1273-1294 (2007) |
| 21 | EE | Mustapha Bouhtou,
Guillaume Erbs,
Michel Minoux:
Joint optimization of pricing and resource allocation in competitive telecommunications networks.
Networks 50(1): 37-49 (2007) |
| 2006 |
|---|
| 20 | EE | F. M. Zeghal,
Michel Minoux:
Modeling and solving a Crew Assignment Problem in air transportation.
European Journal of Operational Research 175(1): 187-209 (2006) |
| 19 | EE | Pierre Bonami,
Michel Minoux:
Exact MAX-2SAT solution via lift-and-project closure.
Oper. Res. Lett. 34(4): 387-393 (2006) |
| 2005 |
|---|
| 18 | EE | Pierre Bonami,
Michel Minoux:
Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation.
Discrete Optimization 2(4): 288-307 (2005) |
| 2004 |
|---|
| 17 | EE | Michel Minoux:
Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems.
Discrete Applied Mathematics 144(1-2): 158-172 (2004) |
| 2003 |
|---|
| 16 | | Virginie Gabrel,
Arnaud Knippel,
Michel Minoux:
A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem.
J. Heuristics 9(5): 429-445 (2003) |
| 2002 |
|---|
| 15 | EE | Virginie Gabrel,
Michel Minoux:
A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems.
Oper. Res. Lett. 30(4): 252-264 (2002) |
| 2001 |
|---|
| 14 | EE | Michel Minoux:
Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods.
Annals OR 106(1-4): 19-46 (2001) |
| 2000 |
|---|
| 13 | EE | Joachim Pistorius,
Edmée Legai,
Michel Minoux:
PartGen: a generator of very large circuits to benchmark thepartitioning of FPGAs.
IEEE Trans. on CAD of Integrated Circuits and Systems 19(11): 1314-1321 (2000) |
| 1999 |
|---|
| 12 | EE | Joachim Pistorius,
Edmée Legai,
Michel Minoux:
Generation of very large circuits to benchmark the partitioning of FPGA.
ISPD 1999: 67-73 |
| 11 | EE | 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.
Discrete Applied Mathematics 90(1-3): 69-88 (1999) |
| 10 | EE | Michel Minoux:
A generalization of the all minors tree theorem to semirings.
Discrete Mathematics 199(1-3): 139-150 (1999) |
| 9 | EE | Virginie Gabrel,
Arnaud Knippel,
Michel Minoux:
Exact solution of multicommodity network optimization problems with general step cost functions.
Oper. Res. Lett. 25(1): 15-23 (1999) |
| 1998 |
|---|
| 8 | | Fahim Rahim-Sarwary,
Emmanuelle Encrenaz,
Michel Minoux,
Rajesh K. Bawa:
Modular model checking of VLSI designs described in VHDL.
Computers and Their Applications 1998: 368-371 |
| 1997 |
|---|
| 7 | EE | Michel Minoux:
Bideterminants, arborescences and extension of the Matrix-Tree theorem to semirings.
Discrete Mathematics 171(1-3): 191-200 (1997) |
| 1992 |
|---|
| 6 | | 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: 62-75 |
| 5 | | Michel Minoux:
The Unique Horn-Satisfiability Problem and Quadratic Boolean Equations.
Ann. Math. Artif. Intell. 6(1-3): 253-266 (1992) |
| 1990 |
|---|
| 4 | EE | Michel Minoux,
Kamel Barkaoui:
Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems.
Discrete Applied Mathematics 29(2-3): 195-210 (1990) |
| 1988 |
|---|
| 3 | | Michel Minoux:
LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation.
Inf. Process. Lett. 29(1): 1-12 (1988) |
| 1986 |
|---|
| 2 | | 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): 163-169 (1986) |
| 1975 |
|---|
| 1 | | Michel Minoux:
Optimisation et Planification de Réseaux de Télécommunications.
Optimization Techniques 1975: 419-430 |
