Ouvrages, ouvrages édités

  • [LeRC06] Le Cun B., Roucairol C., and Crainic T. Parallel branch and bound algorithms. In E.G.  Talbi, editor, Paral lel Combinatorial Optimization, chapter 1. John Wiley & Sons, USA, 2006.  ISBN ISBN-0-471-72101-8.
  • [BaBT08] Baker T.P., Bui A., and Tixeuil S., editors. Principles of Distributed Systems, 12th Internationnal Conference, OPODIS 2008, volume 5401 of Lecture Notes in Computer Science. Springer, 2008.



Revues internationales

  • [FoTs04] Fortin D. and Tseveendorj I. Global optimization and multiknapsack: a percolation algorithm. European Journal of Operational Research, 154(1):46-56, 2004.
  • [BCG+06] Barth D., Cohen J., Gastal L., Mautor T., and Rousseau S. Algorithmic study of  complexity of two quality-of-service packet models in an optical slotted ring network. Journal of  Optical Networking, 5(11):780-789, 2006.
  • [Tsev06] Tseveendorj I. Reverse convex problems: An approach based on optimality conditions. Journal of Applied Mathematics and Decision Sciences, 2006:1-16, 2006.
  • [MaNa07] Mautor T. and Naudin E. Arcs-states models for the vehicle routing problem with time windows and related problems. Computers and Operations Research, 34(4):1061-1084, 2007.
  • [DGRo08] Deschinkel K., Galea F., and Roucairol C. Basics for vector implantation schemes in HDR brachytherapy using a new linear programming model. APJOR Asia-Pacific Journal of Operational Research, 2008.
  • [FoTs08] Fortin D. and Tseveendorj I. A trust branching path heuristic for zero-one programming. European Journal of Operational Research, Reference of online publication: E0R9153, 2008.
  • [FoTs08a] Fortin D. and Tseveendorj I. Piecewise-convex maximization approach to multiknapsack. Optimization, 58(5-6):1-18, 2008.

Conférences internationales avec actes (et comité de lecture)

  • [BCG+04] Barth D., Cohen J., Gastal L., Mautor T., and Rousseau S. Fixed size and variable size packet models in an optical ring network: Complexity and simulations. In International Symposium on Computer And Information Sciences (ISCIS), number 3280 in LNCS, pages 238-246. Springer-Verlag, 2004.
  • [TsFo04] Tseveendorj I. and Fortin D. Nonconvex optimization on a product of spheres: application to multiway discrimination. In L.T.H. An and P.D. Tao, editors, Model ling, Computation and Optimization in Information Systems and Management Sciences,. Hermes Science Publishing, 2004.
  • [DLCR06] Djerrah A., Cun B.L., Cung V.D., and Roucairol C. Bob++: Framework for solving optimization problems with branch-and-bound methods. In HPDC'06, Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing, pages 369-370. 2006.
  • [GaLe07] Galea F. and Le Cun B. Bob++ : a framework for exact combinatorial optimization methods on parallel machines. In PGCO'2007 as part of the 2007 International Conference High Performance Computing & Simulation (HPCS'07) and in conjunction with The 21st European Conference on Modeling and Simulation (ECMS 2007), pages 779-785. June 2007.
  • [DeTo08b] Deschinkel K. and Touati S.A.A. Efficient method for periodic task scheduling with storage requirement minimisation. In Second Annual International Conference on Combinatorial Optimization and Applications (COCOA 2008), LNCS. Springer-Verlag, 2008.
  • [BuFR09] Bui A., Flauzac O., and Rabat C. Fully distributed and fault tolerant task management based on diffusions. In 17th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP'09). IEEE CS Press, 2009

Worshops avec comité de lecture

[CRBe04] Chaari A., Roucairol C., and Abdelaziz. F.B. The stochastic time dependent vehicle
routing problem. In European Conference on Combinatorial Optimization (ECCO XVII). Beirut,
Lebanon, 2004.

 Imprimer  E-mail

Our website is protected by DMC Firewall!