DESIR web - DESIR

[ modifications ] -

[ fiche ] -

Michel Minoux

Professeur
groupe : Décision

Membre permanent
Bureau : 502
Mail :

[ keywords ] -

[ resume ] -

[ bibli ] -

à paraître

	M. Minoux (à paraître) "Duality, Robustness and 2-Stage Robust LP Decision Models. Application to Robust PERT Scheduling". Annales du LAMSADE.
	P. Bonami, V. H. Nguyen, M. Klein et M. Minoux (à paraître) "On the Solution of a Graph Partitioning Problem under Capacity Constraints". In International Symposium on Combinatorial Optimization, Lecture Notes in Computer Science, Vol 7422, Springer-Verlag.

2010

	H. Ouzia et M. Minoux (2010) *"Using DRL relaxations for quadratically constrained pseudoboolean optimization: application to robust Min-Cut"*. Electronic Notes in Discrete Mathematics*, Vol 36, pp. 1217--1224.
	M. Minoux (2010) "Robust Network Optimization under Polyhedral Demand Uncertainty is NP-Hard". Discrete Applied Mathematics, Vol 158, N°5, pp. 597--603.
	C. Gicquel, N. Miégeville, M. Minoux et Y. Dallery (2010) "Optimizing Glass Coating Lines: MIP Models and Valid Inequalities". European Journal of Operational Research, Vol 202, N°3, pp. 747--755.
	H. Ouzia et M. Minoux (2010) *"DRL: A Hierarchy of Strong Block-Decomposable Linear Relaxations for 0-1 MIPs"*. Discrete Applied Mathematics*, Vol 158, pp. 2031--2048.

2009

	C. Gicquel, M. Minoux et Y. Dallery (2009) "A Tight MIP Formulation for the Discrete Lot Sizing and Scheduling Problem with Sequence-Dependent Changeover Costs and Times". Operations Research Letters, Vol 34, pp. 387--393.
	M. Minoux (2009) "On Robust Maximum Flow with Polyhedral Uncertainty Sets". Optimization Letters, Vol 3, pp. 367--376.
	G. Saharidis , M. Minoux et M. Ierapetritou (2009) "Accelerating Benders Method Using Covering Cut Bundle Generation". International Transactions on Operational Research, Vol 17, N°2, pp. 221--237.
	G. Saharidis , M. Minoux et Y. Dallery (2009) "Scheduling of Loading and Unloading of Crude Oil in a Refinery Using Event-Based Discrete-Time Formulation". Computers and Chemical Engineering, Vol 33, N°8, pp. 1413--1426.
	C. Gicquel, M. Minoux et Y. Dallery (2009) "On the Discrete Lot-Sizing and Scheduling Problem with Sequence-Dependent Changeover Time". Operations Research Letters, Vol 37, N°1, pp. 32--36.
	C. Gicquel, N. Miégeville, M. Minoux et Y. Dallery (2009) "Discrete Lot Sizing and Scheduling using Product Decomposition into Attributes". Computers & Operations Research, Vol 36, pp. 2690--2698.
	C. Gicquel, N. Miégeville, M. Minoux et Y. Dallery (2009) "Discrete Lot Sizing and Scheduling using Product Decomposition into Attributes". Computers & Operations Research, Vol 36, pp. 2690--2698.

2008

	M. Minoux (2008) *"Programmation Mathématique. Théorie et Algorithmes"*. 2^e édition, Lavoisier.
	M. Minoux et M. Gondran (2008) *"Graphs, Dioids and Semirings. New Models and Algorithms"*. Springer.
	M. Minoux (2008) "Robust Linear Programming with Right-Handside Uncertainty, Duality and Applications". Encyclopedia of Optimization, pp. 3317--3327.
	M. Minoux (2008) "Solving some Multistage Robust Decision Problems with Huge Implicitly defined Scenario Trees". Algorithmic Operations Research, Vol 4, N°1, pp. 1--18.
	M. Minoux (2008) "The CCB Algorithm : how to improve efficiency of Benders’ Method". In Journées Polyèdres et Optimisation Combinatoire, pp. n/a.
	M. Minoux et H. Ouzia (2008) "On Connections between RLT and Lift-and-Project Relaxations for Ranks 2 and more". In INFORMS annual meeting, pp. n/a.
	M. Minoux (2008) "Closures of disjunctive relaxations and valid inequalities for mixed integer problems and applications". In Modelling, Computation and Optimization in Information Systems and Management Sciences, pp. n/a.

2007

	M. Bouhtou, G. Erbs et M. Minoux (2007) "Joint Optimization of Pricing and Resource Allocation in Competitive Telecommunication Networks". Networks, Vol 50, N°1, pp. 37--49.
	M. Gondran et M. Minoux (2007) "Dioïds and Semirings: Links to Fuzzy Sets and other Applications". Fuzzy Sets and Systems, Vol 158, pp. 1273--1294.
	M. Minoux (2007) "Models and Algorithms for Robust PERT Scheduling with Time-Dependent Task Durations". Vietnam Journal of Mathematics, Vol 35, N°4, pp. 387--398.

2006

	M. Minoux (2006) "Multicommodity Network Flow Models and Algorithms in Telecommunications". In Handbook of Optimization in Telecommunications. P. Pardalos and M. Resende (eds), Kluwer Academic Publishers.
	M. Minoux et P. Bonami (2006) "Une comparaison de quelques méthodes de génération d'inégalités valides pour des problèmes entiers 0-1 généraux". In Optimisation Combinatoire, Vol 2, Hermès.
	M. Minoux et P. Bonami (2006) "Exact MAX-2SAT Solution via Lift-and-Project Closure". Operations Research Letters, Vol 34, pp. 387--393.
	M. Minoux, T. Hoang et N. T. Hoai-Phuong (2006) "Discrete Monotonic Optimization with Application to a Discrete Location Problem". SIAM Journal on Optimization, Vol 17, N°1, pp. 78--97.
	M. Minoux et F. Zeghal (2006) "Modeling and Solving a Crew Assignment Problem in Air Transportation". 4OR - Quaterly Journal of the Belgian, French and Italian Operations Research Societies, Vol 175, pp. 187--209.
	V. H. Nguyen et M. Minoux (2006) "New formulation for the SONET/SDH network design problem". In Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision.

2005

	M. Minoux, G. Erb et M. Bouhtou (2005) "Pricing and Resource Allocationfor Point-to-Point Telecommunication Services in a Competitive Market: Bilevel Optimization Approach". In Telecommunication Planning : Innovations in Pricing, Network Design and Management, Operations Research/Computer Science Interfaces Series. Anandalingam & Raghavan (eds), pp. 1--16, Springer-Verlag.
	M. Minoux et P. Bonami (2005) "Using Rank-1 Lift-and-Project closures to generate Cut for 0-1 MIPs, a Computational Investigation". Discrete Optimization, Vol 2, pp. 288--307.

2004

M. Minoux (2004) "Polynomial Approximation Schemes and Exact Algorithms for Optimum Curve Segmentation Problems". Discrete Applied Mathematics, Vol 144, pp. 158--172.