Farid Ajili

发表

On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price

Wilhelm Cronholm, Farid Ajili, Sofia Panagiotidi, 2005, CPAIOR.

Integrating Constraint Propagation in Complete Solving of Linear Diophantine Systems

Farid Ajili, Hendrik C. R. Lock, 1998, PLILP/ALP.

Avoiding Slack Variables in the Solving of Linear Diophantine Equations and Inequations

Evelyne Contejean, Farid Ajili, Evelyne Contejean, 1997, Theor. Comput. Sci..

A branch-price-and-propagate approach for optimizing IGP weight setting subject to unique shortest paths

Farid Ajili, Robert Rodosek, Andrew Eremin, 2005, SAC '05.

Complete Solving of Linear Diophantine Equations and Inequations without Adding Variables

Evelyne Contejean, Farid Ajili, 1995, CP.

A Modular Framework for the Combination of Unification and Built-In Constraints

Claude Kirchner, Farid Ajili, 1997, ICLP.

Enforcing path uniqueness in internet routing

Farid Ajili, Andrew Eremin, Daniel Lucraft, 2006, SAC '06.

HYBRID PROBLEM SOLVING IN ECLiPSe

Farid Ajili, Mark Wallace, M. Wallace, 2004 .

Strong Cost-Based Filtering for Lagrange Decomposition Applied to Network Design

Wilhelm Cronholm, Farid Ajili, 2004, CP.

A Probe-Based Algorithm for Piecewise Linear Optimization in Scheduling

Farid Ajili, Hani El Sakkout, Farid Ajili, 2003, Ann. Oper. Res..

Complete Solving of Linear Diophantine Equational and Inequational Systems without Adding Variables

Evelyne Contejean, Farid Ajili, 1995 .