|
Search the dblp DataBase
Farid Ajili:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Farid Ajili, Evelyne Contejean
Complete Solving of Linear Diophantine Equations and Inequations without Adding Variables. [Citation Graph (0, 0)][DBLP] CP, 1995, pp:1-17 [Conf]
- Wilhelm Cronholm, Farid Ajili
Strong Cost-Based Filtering for Lagrange Decomposition Applied to Network Design. [Citation Graph (0, 0)][DBLP] CP, 2004, pp:726-730 [Conf]
- Wilhelm Cronholm, Farid Ajili, Sofia Panagiotidi
On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price. [Citation Graph (0, 0)][DBLP] CPAIOR, 2005, pp:125-139 [Conf]
- Farid Ajili, Claude Kirchner
A Modular Framework for the Combination of Unification and Built-In Constraints. [Citation Graph (0, 0)][DBLP] ICLP, 1997, pp:331-345 [Conf]
- Farid Ajili, Hendrik C. R. Lock
Integrating Constraint Propagation in Complete Solving of Linear Diophantine Systems. [Citation Graph (0, 0)][DBLP] PLILP/ALP, 1998, pp:463-480 [Conf]
- Farid Ajili, Robert Rodosek, Andrew Eremin
A branch-price-and-propagate approach for optimizing IGP weight setting subject to unique shortest paths. [Citation Graph (0, 0)][DBLP] SAC, 2005, pp:366-370 [Conf]
- Daniel Lucraft, Andrew Eremin, Farid Ajili
Enforcing path uniqueness in internet routing. [Citation Graph (0, 0)][DBLP] SAC, 2006, pp:399-403 [Conf]
- Farid Ajili, Evelyne Contejean
Avoiding Slack Variables in the Solving of Linear Diophantine Equations and Inequations. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:173, n:1, pp:183-208 [Journal]
Search in 0.002secs, Finished in 0.003secs
|