| 2006 |
|---|
| 9 | EE | Daniel Lucraft,
Andrew Eremin,
Farid Ajili:
Enforcing path uniqueness in internet routing.
SAC 2006: 399-403 |
| 2005 |
|---|
| 8 | EE | Wilhelm Cronholm,
Farid Ajili,
Sofia Panagiotidi:
On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price.
CPAIOR 2005: 125-139 |
| 7 | EE | Farid Ajili,
Robert Rodosek,
Andrew Eremin:
A branch-price-and-propagate approach for optimizing IGP weight setting subject to unique shortest paths.
SAC 2005: 366-370 |
| 2004 |
|---|
| 6 | EE | Wilhelm Cronholm,
Farid Ajili:
Strong Cost-Based Filtering for Lagrange Decomposition Applied to Network Design.
CP 2004: 726-730 |
| 2003 |
|---|
| 5 | EE | Farid Ajili,
Hani El Sakkout:
A Probe-Based Algorithm for Piecewise Linear Optimization in Scheduling.
Annals OR 118(1-4): 35-48 (2003) |
| 1998 |
|---|
| 4 | EE | Farid Ajili,
Hendrik C. R. Lock:
Integrating Constraint Propagation in Complete Solving of Linear Diophantine Systems.
PLILP/ALP 1998: 463-480 |
| 1997 |
|---|
| 3 | | Farid Ajili,
Claude Kirchner:
A Modular Framework for the Combination of Unification and Built-In Constraints.
ICLP 1997: 331-345 |
| 2 | EE | Farid Ajili,
Evelyne Contejean:
Avoiding Slack Variables in the Solving of Linear Diophantine Equations and Inequations.
Theor. Comput. Sci. 173(1): 183-208 (1997) |
| 1995 |
|---|
| 1 | | Farid Ajili,
Evelyne Contejean:
Complete Solving of Linear Diophantine Equations and Inequations without Adding Variables.
CP 1995: 1-17 |
