Ahmed Hadjar

According to our database, Ahmed Hadjar authored at least 7 papers between 1996 and 2013.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2013

Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem.

Mounira Groiez, Guy Desaulniers, Ahmed Hadjar, Odile Marcotte

EURO J. Comput. Optim., 2013

2010

Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling.

Stefan Irnich, Guy Desaulniers, Jacques Desrosiers, Ahmed Hadjar

INFORMS J. Comput., 2010

2009

Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows.

Ahmed Hadjar, François Soumis

Comput. Oper. Res., 2009

2008

Tabu Search, Partial Elementarity, and Generalized <i>k</i>-Path Inequalities for the Vehicle Routing Problem with Time Windows.

Guy Desaulniers, François Lessard, Ahmed Hadjar

Transp. Sci., 2008

2006

A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem.

Ahmed Hadjar, Odile Marcotte, François Soumis

Oper. Res., 2006

2002

The stable set polytope and some operations on graphs.

Jean Fonlupt, Ahmed Hadjar

Discret. Math., 2002

1996

Composition de polyèdres associés aux problèmes d'optimisation combinatoire. (Composition of polyhedra and their relation to some combinatorial optimization problems).

Ahmed Hadjar

PhD thesis, 1996