Complete Solving of Linear Diophantine Equations and Inequations without Adding Variables. - Farid Ajili; Evelyne Contejean (CP, 1995)

Complete Solving of Linear Diophantine Equations and Inequations without Adding Slack Variables. - Farid Ajili; Evelyne Contejean (UNIF, 1995)

A Modular Framework for the Combination of Unification and Built-In Constraints. - Farid Ajili; Claude Kirchner (ICLP, 1997)

Avoiding Slack Variables in the Solving of Linear Diophantine Equations and Inequations. - Farid Ajili; Evelyne Contejean (Theor. Comput. Sci., 1997)

Integrating Constraint Propagation in Complete Solving of Linear Diophantine Systems. - Farid Ajili; Hendrik C. R. Lock (PLILP/ALP, 1998)

Contraintes Diophantiennes Linéaires : résolution et coopération inter-résolveurs. (Linear diophantine constraints : solving and cooperation of solvers). - Farid Ajili (1998)

A Probe-Based Algorithm for Piecewise Linear Optimization in Scheduling. - Farid Ajili; Hani El Sakkout (Ann. Oper. Res., 2003)

Strong Cost-Based Filtering for Lagrange Decomposition Applied to Network Design. - Wilhelm Cronholm; Farid Ajili (CP, 2004)

On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price. - Wilhelm Cronholm; Farid Ajili; Sofia Panagiotidi (CPAIOR, 2005)

A branch-price-and-propagate approach for optimizing IGP weight setting subject to unique shortest paths. - Farid Ajili; Robert Rodosek; Andrew Eremin (SAC, 2005)

Enforcing path uniqueness in internet routing. - Daniel Lucraft; Andrew Eremin; Farid Ajili (SAC, 2006)