## Introduction

One aspect of my research concerns the design of softwares to write solvers for optimization problems. These works began with Bob for Branch and Bound in the 1994, Bob have been extended with A*, IDA*, Divide and Conquer, and Dynamic programming. I have continue now with Bob++ where Divide and conquer, Branch and Bound are proposed as programming interface but also, a possibility of simulation, and Varaible neighborhood Search (VNS).

**CVLB11**:B Chiquet , P Vander-Swalmen , B LeCun , A Bui ,*"Élaboration d’une méta-heuristique parallèle pour le Crew Scheduling Problem"*, Roadef 2011, St-Etienne, France, March, 2011,**GaLe09**:F Galea , B LeCun ,*"Gestion des symétries dans une résolution exacte de l'affectation quadratique à trois dimensions"*, Roadef 2009, Nancy, France, Feb, 2009, Abstract slide**GaLe10**:F Galea , B LeCun ,*"Résolution parallèle de l'affectation quadratique à 3 dimensions"*, Roadef 2010, Toulouse, France, Feb, 2010,**GaLe07**:F Galea , B LeCun ,*"Bob++ : a Framework for Exact Combinatorial Optimization Methods on Parallel Machines"*, 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), Prague, Czech Republic, Jun, 2007, pp:779--785,**Lecu07**:B LeCun ,*"Logiciels libres pour le développement de Branch and Bound séquentiels ou parallèles"*, Joint conference Roadef-Francoro 2007, Grenoble, France, Feb, 2007,

I have also written several sofwares that are for my private use at this time. Maybe, one time i will put them on the Web.