RLFAP is a real world problem and refers to the allocation of frequencies to radio links. All the instances of the problem involve optimization, some of them are Partial CSPs while others Constrained Optimization Problems. You can get more information and the instances of the problem from Constraints Archive or the CALMA Project.

The best known solutions for all except one of the problem instances are given below. The algorithm used to find these solutions is an extension of GENET network to Partial CSPs and combinatorial optimization.

- celar1.bsf solution has cost 16.
- celar2.bsf solution has cost 14.
- celar3.bsf solution has cost 14.
- celar4.bsf solution has cost 46.
- celar5.bsf solution has cost 792.
- celar6.bsf solution has cost 3,570 New!!! (previous 3,623).
- celar7.bsf solution has cost 374,705.
- celar8.bsf solution has cost 282 New!!! (Previous 287).
- celar9.bsf solution has cost 15,716.
- celar11.bsf solution has cost 28 New!!! (previous 30).