@InProceedings{ocad:ALMP03, author = "Rafael Castro De Andrade and Abdel Lisser and Nelson Maculan and G\'erard Plateau", title = "Synth\`ese de r\'eseaux multiservice \`a demande incertaine", year = 2003, booktitle = "5e congr\`es de la Soci\'et\'e Fran\,caise de Recherche Op\'erationnelle et d'Aide \`a la D\'ecision", address = "Avignon", lipn-category = "autc" } @Article{ocad:ALMP04, AUTHOR = "Rafael Castro De Andrade and Abdel Lisser and Nelson Maculan and G\'erard Plateau", title = "Telecommunication network capacity design for uncertain demand", journal = "Computational Optimization and Applications", year = 2004, volume = 29, number = 2, pages = "127-146", lipn-category = "jour" } @Article{ocad:ALMP05, author = "Rafael Castro De Andrade and Abdel Lisser and Nelson Maculan and G\'erard Plateau", title = "B \& B frameworks for the capacity expansion of high speed telecommunication network under uncertainty", journal = "Annals of Operations Research", year = 2005, volume = 140, number = 1, pages = "49-65", lipn-category = "jour" } @Article{ocad:ALMP06, author = "Rafael Castro De Andrade and Abdel Lisser and Nelson Maculan and G\'erard Plateau", title = "Enhancing a branch-and-bound algorithm for two-stages stochastic integer problems", journal = "Management Science", year = 2006, volume = 52, number = 9, pages = "1450-1455", lipn-category = "jour" } @InProceedings{ocad:EEGP06a, author = "Didier El Baz and Moussa Elkihel and Laurent G\'ely and G\'erard Plateau", title = "Improved time and space complexity for Kianfar's inequality rotation algorithm", year = 2006, booktitle = "META'O6", address = "Hammamet, Tunisie", lipn-category = "autc" } @TechReport{ocad:EEGP06b, author = "Didier El Baz and Moussa Elkihel and Laurent G\'ely and G\'erard Plateau", title = "Improved time and space complexity for Kianfar's inequality rotation algorithm", institution = "LAAS, Toulouse", number = "06834", type = {RR}, year = 2006 , lipn-category = "rapl" } @Article{ocad:MPL03, author = "Nelson Maculan and G\'erard Plateau and Abdel Lisser", title = "Integer linear models with a polynomial number of variables and constraints for some classical combinatorial problems", journal = "Pesquisa Operacional", year = 2003, volume = 23, number = 1, pages = "161-168", lipn-category ="autj" } @inBook{ocad:PN07, author = "G\'erard Plateau and Anass Nagih", title = "Le probl\`eme du sac \`a dos en variables 0-1", booktitle = "Optimisation combinatoire 4 : probl\`emes paradigmatiques", publisher = "Herm\`es (V. Paschos ed.)", chapter = "6", address = "Paris", pages = "163-190", year = 2007, lipn-category = "chap" } @Article{ocad:TNP03a, author = "Babacar Thiongane and Anass Nagih and G\'erard Plateau", title = "Analyse de sensibilit\'e pour les probl\`emes lin\'eaires en variables 0-1", journal = "RAIRO-Operations Research", year = 2003, volume = 37, number = 4, pages = "291-309", lipn-category ="autj" } @InProceedings{ocad:TNP03b, author = "Babacar Thiongane and Anass Nagih and G\'erard Plateau", title = "Techniques de r\'eoptimisation dans une s\'equence d'instances du probl\`eme du sac \`a dos unidimensionnel 0-1", year = 2003, booktitle = "5e congr\`es de la Soci\'et\'e Fran\c caise de Recherche Op\'erationnelle et d'Aide \`a la D\'ecision", address = "Avignon", lipn-category = "autc" } @TechReport{ocad:TNP03c, author = "Babacar Thiongane and Anass Nagih and G\'erard Plateau", title = "Algorithms and complexity for parametric 0-1 linear programs relative to the objective function", institution = "Laboratoire d'Informatique de Paris-Nord (LIPN), universit\'e Paris 13", number = "2003-01", type = {RR}, year = 2003, lipn-category = "rapl" } @Article{ocad:TNP05, author = "Babacar Thiongane and Anass Nagih and G\'erard Plateau", title = "Adapted step size in a 0-1 biknapsack lagrangean dual solving algorithm", journal = "Annals of Operations Research", year = 2005, volume = 139, pages = "353-373", lipn-category ="jour" } @Article{ocad:TNP06, author = {Babacar Thiongane and Anass Nagih and G\'erard Plateau}, title = {Lagrangean heuristics combined with reoptimization for the 0-1 biknapsack problem}, journal = {Discrete Applied Mathematics}, year = 2006, volume = 154, pages = "2200-2211", lipn-category ="jour" }