default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichel Minoux
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2022
[j65]David Wu, Viet Hung Nguyen
, Michel Minoux, Hai Tran:
Optimal deterministic and robust selection of electricity contracts. J. Glob. Optim. 82(4): 993-1013 (2022)- 2021
- [j64]Viet Hung Nguyen, Michel Minoux:
Linear size MIP formulation of Max-Cut: new properties, links with cycle inequalities and computational results. Optim. Lett. 15(4): 1041-1060 (2021) - 2019
- [j63]Julien Lesca, Michel Minoux, Patrice Perny:
The Fair OWA One-to-One Assignment Problem: NP-Hardness and Polynomial Time Special Cases. Algorithmica 81(1): 98-123 (2019) - [j62]Thi-Minh Nguyen, Michel Minoux, Serge Fdida:
Optimizing resource utilization in NFV dynamic systems: New exact and heuristic approaches. Comput. Networks 148: 129-141 (2019) - [j61]Michel Minoux, Riadh Zorgati:
Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems. J. Glob. Optim. 75(3): 735-766 (2019) - 2018
- [j60]Oumaima Khaled, Michel Minoux, Vincent Mousseau, Stéphane Michel, Xavier Ceugniet:
A compact optimization model for the tail assignment problem. Eur. J. Oper. Res. 264(2): 548-557 (2018) - [j59]Michel Minoux:
Robust and stochastic multistage optimisation under Markovian uncertainty with applications to production/inventory problems. Int. J. Prod. Res. 56(1-2): 565-583 (2018) - 2017
- [j58]Dang Phuong Nguyen, Michel Minoux, Viet Hung Nguyen, Thanh Hai Nguyen, Renaud Sirdey:
Improved compact formulations for a wide class of graph partitioning problems in sparse graphs. Discret. Optim. 25: 175-188 (2017) - [j57]Michel Minoux, Riadh Zorgati:
Global probability maximization for a Gaussian bilateral inequality in polynomial time. J. Glob. Optim. 68(4): 879-898 (2017) - [j56]Viet Hung Nguyen, Michel Minoux, Dang Phuong Nguyen:
Reduced-size formulations for metric and cut polyhedra in sparse graphs. Networks 69(1): 142-150 (2017) - [j55]Viet Hung Nguyen, Michel Minoux:
Improved linearized models for graph partitioning problem under capacity constraints. Optim. Methods Softw. 32(4): 892-903 (2017) - 2016
- [j54]Mouna Kchaou Boujelben, Céline Gicquel, Michel Minoux:
A MILP model and heuristic approach for facility location under multiple operational constraints. Comput. Ind. Eng. 98: 446-461 (2016) - [j53]Michel Minoux, Riadh Zorgati:
Convexity of Gaussian chance constraints and of related probability maximization problems. Comput. Stat. 31(1): 387-408 (2016) - [j52]Viet Hung Nguyen, Michel Minoux, Dang Phuong Nguyen:
Improved compact formulations for metric and cut polyhedra. Electron. Notes Discret. Math. 52: 125-132 (2016) - [j51]Dang Phuong Nguyen, Michel Minoux, Viet Hung Nguyen, Thanh Hai Nguyen, Renaud Sirdey:
Stochastic graph partitioning: quadratic versus SOCP formulations. Optim. Lett. 10(7): 1505-1518 (2016) - 2015
- [j50]Céline Gicquel, Michel Minoux:
Multi-product valid inequalities for the discrete lot-sizing and scheduling problem. Comput. Oper. Res. 54: 12-20 (2015) - [j49]Mamane Souley Ibrahim, Nelson Maculan, Michel Minoux:
Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles. Optim. Lett. 9(2): 345-357 (2015) - 2014
- [j48]Mouna Kchaou Boujelben, Céline Gicquel, Michel Minoux:
A distribution network design problem in the automotive industry: MIP formulation and heuristics. Comput. Oper. Res. 52: 16-28 (2014) - [j47]Céline Gicquel, Abdel Lisser, Michel Minoux:
An evaluation of semidefinite programming based approaches for discrete lot-sizing problems. Eur. J. Oper. Res. 237(2): 498-507 (2014) - [j46]Michel Minoux:
Two-stage robust optimization, state-space representable uncertainty and applications. RAIRO Oper. Res. 48(4): 455-475 (2014) - 2013
- [j45]Julien Lesca, Michel Minoux, Patrice Perny:
Compact versus noncompact LP formulations for minimizing convex Choquet integrals. Discret. Appl. Math. 161(1-2): 184-199 (2013) - 2012
- [j44]Céline Gicquel, L. Hege, Michel Minoux, W. van Canneyt:
A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints. Comput. Oper. Res. 39(3): 629-636 (2012) - [j43]Céline Gicquel, Laurence A. Wolsey, Michel Minoux:
On discrete lot-sizing and scheduling on identical parallel machines. Optim. Lett. 6(3): 545-557 (2012) - [j42]Michel Minoux:
Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard. Optim. Lett. 6(7): 1463-1475 (2012) - 2011
- [j41]Michel Minoux:
On 2-stage robust LP with RHS uncertainty: complexity results and applications. J. Glob. Optim. 49(3): 521-537 (2011) - 2010
- [j40]Michel Minoux:
Robust network optimization under polyhedral demand uncertainty is NP-hard. Discret. Appl. Math. 158(5): 597-603 (2010) - [j39]Michel Minoux, Hacene Ouzia:
DRL*: A hierarchy of strong block-decomposable linear relaxations for 0-1 MIPs. Discret. Appl. Math. 158(18): 2031-2048 (2010) - [j38]Michel Minoux, Hacene Ouzia:
Using DRL* relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut. Electron. Notes Discret. Math. 36: 1217-1224 (2010) - [j37]Céline Gicquel, N. Miègeville, Michel Minoux, Yves Dallery:
Optimizing glass coating lines: MIP model and valid inequalities. Eur. J. Oper. Res. 202(3): 747-755 (2010) - [j36]Georgios K. D. Saharidis, Michel Minoux, Marianthi G. Ierapetritou:
Accelerating Benders method using covering cut bundle generation. Int. Trans. Oper. Res. 17(2): 221-237 (2010) - 2009
- [j35]Michel Minoux:
Solving some Multistage Robust Decision Problems with Huge Implicitly Defined Scenario Trees. Algorithmic Oper. Res. 4(1): 1-18 (2009) - [j34]Georgios K. D. Saharidis, Michel Minoux, Yves Dallery:
Scheduling of loading and unloading of crude oil in a refinery using event-based discrete time formulation. Comput. Chem. Eng. 33(8): 1413-1426 (2009) - [j33]Céline Gicquel, N. Miègeville, Michel Minoux, Yves Dallery:
Discrete lot sizing and scheduling using product decomposition into attributes. Comput. Oper. Res. 36(9): 2690-2698 (2009) - [j32]Mamane Souley Ibrahim, Nelson Maculan, Michel Minoux:
A strong flow-based formulation for the shortest path problem in digraphs with negative cycles. Int. Trans. Oper. Res. 16(3): 361-369 (2009) - [j31]Michel Minoux:
On robust maximum flow with polyhedral uncertainty sets. Optim. Lett. 3(3): 367-376 (2009) - [j30]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
- [j29]Michel Gondran, Michel Minoux:
Dioïds and semirings: Links to fuzzy sets and other applications. Fuzzy Sets Syst. 158(12): 1273-1294 (2007) - [j28]Mustapha Bouhtou, Guillaume Erbs, Michel Minoux:
Joint optimization of pricing and resource allocation in competitive telecommunications networks. Networks 50(1): 37-49 (2007) - 2006
- [j27]F. M. Zeghal, Michel Minoux:
Modeling and solving a Crew Assignment Problem in air transportation. Eur. J. Oper. Res. 175(1): 187-209 (2006) - [j26]Pierre Bonami, Michel Minoux:
Exact MAX-2SAT solution via lift-and-project closure. Oper. Res. Lett. 34(4): 387-393 (2006) - [j25]Hoang Tuy, Michel Minoux, N. T. Hoai-Phuong:
Discrete Monotonic Optimization with Application to a Discrete Location Problem. SIAM J. Optim. 17(1): 78-97 (2006) - 2005
- [j24]Pierre Bonami, Michel Minoux:
Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation. Discret. Optim. 2(4): 288-307 (2005) - 2004
- [j23]Michel Minoux:
Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems. Discret. Appl. Math. 144(1-2): 158-172 (2004) - 2003
- [j22]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
- [j21]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
- [j20]Michel Minoux:
Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods. Ann. Oper. Res. 106(1-4): 19-46 (2001) - 2000
- [j19]Joachim Pistorius, Edmée Legai, Michel Minoux:
PartGen: a generator of very large circuits to benchmark thepartitioning of FPGAs. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(11): 1314-1321 (2000) - 1999
- [j18]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. Discret. Appl. Math. 90(1-3): 69-88 (1999) - [j17]Michel Minoux:
A generalization of the all minors tree theorem to semirings. Discret. Math. 199(1-3): 139-150 (1999) - [j16]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) - 1997
- [j15]Michel Minoux:
Bideterminants, arborescences and extension of the Matrix-Tree theorem to semirings. Discret. Math. 171(1-3): 191-200 (1997) - 1995
- [j14]Michel Minoux:
On some large-scale LP relaxations for the Graph Partitioning Problem and their optimal solutions. Ann. Oper. Res. 58(3): 141-154 (1995) - 1994
- [j13]J. C. Dodu, T. Eve, Michel Minoux:
Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results. Numer. Algorithms 6(2): 245-273 (1994) - 1992
- [j12]Michel Minoux:
The Unique Horn-Satisfiability Problem and Quadratic Boolean Equations. Ann. Math. Artif. Intell. 6(1-3): 253-266 (1992) - 1990
- [j11]Michel Minoux, Kamel Barkaoui:
Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems. Discret. Appl. Math. 29(2-3): 195-210 (1990) - 1989
- [j10]Michel Minoux:
Solving combinatorial problems with combined Min-Max-Min-Sum objective and applications. Math. Program. 45(1-3): 361-372 (1989) - [j9]Michel Minoux:
Networks synthesis and optimum network design problems: Models, solution methods and applications. Networks 19(3): 313-360 (1989) - [j8]Réjean Lessard, Jean-Marc Rousseau, Michel Minoux:
A new algorithm for general matching problems using network flow subproblems. Networks 19(4): 459-479 (1989) - [j7]Pedro Cox, Henri Maître, Michel Minoux, Celso C. Ribeiro:
Optimal matching of convex polygons. Pattern Recognit. Lett. 9(5): 327-334 (1989) - 1988
- [j6]Michel Minoux:
LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation. Inf. Process. Lett. 29(1): 1-12 (1988) - [j5]Brigitte Jaumard, Michel Minoux, Pierre Siohan:
Finite precision design of FIR digital filters using a convexity property. IEEE Trans. Acoust. Speech Signal Process. 36(3): 407-411 (1988) - 1986
- [j4]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) - [j3]Pierre Hansen, Brigitte Jaumard, Michel Minoux:
A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities. Math. Program. 34(2): 223-231 (1986) - 1985
- [j2]Celso C. Ribeiro, Michel Minoux:
A heuristic approach to hard constrained shortest path problems. Discret. Appl. Math. 10(2): 125-137 (1985) - [j1]Alain Billionnet, Michel Minoux:
Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions. Discret. Appl. Math. 12(1): 1-11 (1985)
Conference and Workshop Papers
- 2021
- [c10]David Wu, Viet Hung Nguyen, Michel Minoux, Hai Tran:
An integer programming model for minimizing energy cost in water distribution system using trigger levels with additional time slots. RIVF 2021: 1-6 - 2014
- [c9]Céline Gicquel, Michel Minoux:
Solving to Optimality a Discrete Lot-Sizing Problem Thanks to Multi-product Multi-period Valid Inequalities. ICORES (Selected Papers) 2014: 237-250 - [c8]Céline Gicquel, Michel Minoux:
New Multi-product Valid Inequalities for a Discrete Lot-sizing Problem. ICORES 2014: 355-362 - 2012
- [c7]Pierre Bonami, Viet Hung Nguyen, Michel Klein, Michel Minoux:
On the Solution of a Graph Partitioning Problem under Capacity Constraints. ISCO 2012: 285-296 - 2011
- [c6]Mustapha Bouhtou, Jean-Robin Medori, Michel Minoux:
Mixed Integer Programming Model for Pricing in Telecommunication. INOC 2011: 626-630 - 2007
- [c5]Michel Minoux:
Semirings, Dioids and Their Links to Fuzzy Sets and Other Applications. EUSFLAT Conf. (1) 2007: 25-25 - 1999
- [c4]Joachim Pistorius, Edmée Legai, Michel Minoux:
Generation of very large circuits to benchmark the partitioning of FPGA. ISPD 1999: 67-73 - 1998
- [c3]Fahim Rahim-Sarwary, Emmanuelle Encrenaz, Michel Minoux, Rajesh K. Bawa:
Modular model checking of VLSI designs described in VHDL. CATA 1998: 368-371 - 1992
- [c2]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 - 1975
- [c1]Michel Minoux:
Optimisation et Planification de Réseaux de Télécommunications. Optimization Techniques 1975: 419-430
Parts in Books or Collections
- 2006
- [p1]Michel Minoux:
Multicommodity Network Flow Models and Algorithms in Telecommunications. Handbook of Optimization in Telecommunications 2006: 163-184
Reference Works
- 2009
- [r2]Michel Minoux, P. Mavrocordatos:
Maximum Constraint Satisfaction: Relaxations and Upper Bounds. Encyclopedia of Optimization 2009: 1981-1991 - [r1]Michel Minoux:
Robust Linear Programming with Right-Hand-Side Uncertainty, Duality and Applications. Encyclopedia of Optimization 2009: 3317-3327
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
