Skip to Main content Skip to Navigation


...
hal-01096049v1  Book sections
Jean-Antoine Désidéri. Multiple-Gradient Descent Algorithm (MGDA) for Pareto-Front Identification
Fitzgibbon, W.; Kuznetsov, Y.A.; Neittaanmæki, P.; Pironneau, O. Modeling, Simulation and Optimization for Science and Technology, 34, Springer, 2014, Computational Methods in Applied Sciences, 978-94-017-9054-3
...
hal-00732881v1  Reports
Jean-Antoine Désidéri. MGDA Variants for Multi-Objective Optimization
[Research Report] RR-8068, INRIA. 2012, pp.16
...
hal-00694039v2  Reports
Jean-Antoine Désidéri. Application of MGDA to domain partitioning
[Research Report] RR-7968, INRIA. 2012, pp.34
...
tel-01252937v2  Theses
Rémy Thomasse. Complexity analysis of random convex hulls
Other [cs.OH]. Université Nice Sophia Antipolis, 2015. English. ⟨NNT : 2015NICE4116⟩
inria-00100114v1  Journal articles
Egon BalasAlexander BockmayrNicolai PisarukLaurence Wolsey. On unions and dominants of polytopes
Mathematical Programming, Springer Verlag, 2004, 99 (2), pp.223-239
inria-00099613v1  Conference papers
Bruno GaujalNicolas NavetCormac Walsh. Real-time scheduling for optimal energy use
4èmes Journées Francophones d'Etudes Faible Tension Faible Consommation 2003 - FTFC'03, 2003, Paris/France, 8 p
inria-00101057v1  Reports
Egon BalasAlexander BockmayrNicolai PisarukLaurence Wolsey. On unions and dominants of polytopes
[Intern report] A02-R-104 || balas02a, 2002, 23 p