Farid Ajili - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 11 from 11

2006

Enforcing path uniqueness in internet routingDaniel Lucraft, Andrew Eremin, Farid Ajili. SAC 2006: 399-403 [doi]

2005

A branch-price-and-propagate approach for optimizing IGP weight setting subject to unique shortest pathsFarid Ajili, Robert Rodosek, Andrew Eremin. SAC 2005: 366-370 [doi]

On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-PriceWilhelm Cronholm, Farid Ajili, Sofia Panagiotidi. cpaior 2005: 125-139 [doi]

2004

Strong Cost-Based Filtering for Lagrange Decomposition Applied to Network DesignWilhelm Cronholm, Farid Ajili. cp 2004: 726-730 [doi]

2003

A Probe-Based Algorithm for Piecewise Linear Optimization in SchedulingFarid Ajili, Hani El Sakkout. anor, 118(1-4):35-48, 2003. [doi]

1998

Integrating Constraint Propagation in Complete Solving of Linear Diophantine SystemsFarid Ajili, Hendrik C. R. Lock. plilp 1998: 463-480 [doi]

Contraintes Diophantiennes Linéaires : résolution et coopération inter-résolveurs. (Linear diophantine constraints : solving and cooperation of solvers)Farid Ajili. PhD thesis, Henri Poincaré University, Nancy, France, 1998. [doi]

1997

A Modular Framework for the Combination of Unification and Built-In ConstraintsFarid Ajili, Claude Kirchner. ICLP 1997: 331-345

Avoiding Slack Variables in the Solving of Linear Diophantine Equations and InequationsFarid Ajili, Evelyne Contejean. TCS, 173(1):183-208, 1997. [doi]

1995

Complete Solving of Linear Diophantine Equations and Inequations without Adding VariablesFarid Ajili, Evelyne Contejean. cp 1995: 1-17

Complete Solving of Linear Diophantine Equations and Inequations without Adding Slack VariablesFarid Ajili, Evelyne Contejean. UNIF 1995: 1

Sign in or sign up to see more results.

runs on WebDSL