Farid Ajili

According to our database1, Farid Ajili authored at least 11 papers between 1995 and 2006.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2006
Enforcing path uniqueness in internet routing.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

2005
A branch-price-and-propagate approach for optimizing IGP weight setting subject to unique shortest paths.
Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2005

2004
Strong Cost-Based Filtering for Lagrange Decomposition Applied to Network Design.
Proceedings of the Principles and Practice of Constraint Programming, 2004

2003
A Probe-Based Algorithm for Piecewise Linear Optimization in Scheduling.
Ann. Oper. Res., 2003

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

Integrating Constraint Propagation in Complete Solving of Linear Diophantine Systems.
Proceedings of the Principles of Declarative Programming, 10th International Symposium, 1998

1997
Avoiding Slack Variables in the Solving of Linear Diophantine Equations and Inequations.
Theor. Comput. Sci., 1997

A Modular Framework for the Combination of Unification and Built-In Constraints.
Proceedings of the Logic Programming, 1997

1995
Complete Solving of Linear Diophantine Equations and Inequations without Adding Slack Variables.
Proceedings of the 9th International Workshop on Unification, 1995

Complete Solving of Linear Diophantine Equations and Inequations without Adding Variables.
Proceedings of the Principles and Practice of Constraint Programming, 1995


  Loading...