The SCEAS System
| |||||||

## Search the dblp DataBase
Michel Minoux:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Michel Minoux
**LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation.**[Citation Graph (1, 0)][DBLP] Inf. Process. Lett., 1988, v:29, n:1, pp:1-12 [Journal] - Kamel Barkaoui, Michel Minoux
**A Polynomial-Time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets.**[Citation Graph (0, 0)][DBLP] Application and Theory of Petri Nets, 1992, pp:62-75 [Conf] - Michel Minoux
**Optimisation et Planification de Réseaux de Télécommunications.**[Citation Graph (0, 0)][DBLP] Optimization Techniques, 1975, pp:419-430 [Conf] - Joachim Pistorius, Edmée Legai, Michel Minoux
**Generation of very large circuits to benchmark the partitioning of FPGA.**[Citation Graph (0, 0)][DBLP] ISPD, 1999, pp:67-73 [Conf] - Michel Minoux
**The Unique Horn-Satisfiability Problem and Quadratic Boolean Equations.**[Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 1992, v:6, n:1-3, pp:253-266 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:90, n:1-3, pp:69-88 [Journal] - Michel Minoux
**Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2004, v:144, n:1-2, pp:158-172 [Journal] - Virginie Gabrel, Arnaud Knippel, Michel Minoux
**A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem.**[Citation Graph (0, 0)][DBLP] J. Heuristics, 2003, v:9, n:5, pp:429-445 [Journal] - Brigitte Jaumard, Michel Minoux
**An Efficient Algorithm for the Transitive Closure and a Linear Worst-Case Complexity Result for a Class of Sparse Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1986, v:22, n:4, pp:163-169 [Journal] - Pierre Bonami, Michel Minoux
**Exact MAX-2SAT solution via lift-and-project closure.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2006, v:34, n:4, pp:387-393 [Journal] - Virginie Gabrel, Arnaud Knippel, Michel Minoux
**Exact solution of multicommodity network optimization problems with general step cost functions.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 1999, v:25, n:1, pp:15-23 [Journal] - Virginie Gabrel, Michel Minoux
**A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2002, v:30, n:4, pp:252-264 [Journal] - Joachim Pistorius, Edmée Legai, Michel Minoux
**PartGen: a generator of very large circuits to benchmark thepartitioning of FPGAs.**[Citation Graph (0, 0)][DBLP] IEEE Trans. on CAD of Integrated Circuits and Systems, 2000, v:19, n:11, pp:1314-1321 [Journal] - F. M. Zeghal, Michel Minoux
**Modeling and solving a Crew Assignment Problem in air transportation.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2006, v:175, n:1, pp:187-209 [Journal] - Fahim Rahim-Sarwary, Emmanuelle Encrenaz, Michel Minoux, Rajesh K. Bawa
**Modular model checking of VLSI designs described in VHDL.**[Citation Graph (0, 0)][DBLP] Computers and Their Applications, 1998, pp:368-371 [Conf] - Michel Minoux
**A generalization of the all minors tree theorem to semirings.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:199, n:1-3, pp:139-150 [Journal] - Michel Minoux
**Bideterminants, arborescences and extension of the Matrix-Tree theorem to semirings.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:171, n:1-3, pp:191-200 [Journal] - Michel Gondran, Michel Minoux
**Dioïds and semirings: Links to fuzzy sets and other applications.**[Citation Graph (0, 0)][DBLP] Fuzzy Sets and Systems, 2007, v:158, n:12, pp:1273-1294 [Journal] **Semirings, Dioids and Their Links to Fuzzy Sets and Other Applications.**[Citation Graph (, )][DBLP]**Discrete lot sizing and scheduling using product decomposition into attributes.**[Citation Graph (, )][DBLP]**Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems.**[Citation Graph (, )][DBLP]**Robust network optimization under polyhedral demand uncertainty is NP-hard.**[Citation Graph (, )][DBLP]
Search in 0.025secs, Finished in 0.026secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |