Developing approaches for solving a telecommunications feature subscription problem

Citations of this article
Mendeley users who have this article in their library.


Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature subscription involves choosing and sequencing features from a catalogue and is subject to constraints that prevent undesirable feature interactions at run-time. When the subscription requested by a user is inconsistent, one problem is to f find an optimal relaxation, which is a generalisation of the feedback vertex set problem on directed graphs, and thus it is an NP-hard task. We present several constraint programming formulations of the problem. We also present formulations using partial weighted maximum Boolean satisfiability and mixed integer linear programming. We study all these formulations by experimentally comparing them on a variety of randomly generated instances of the feature subscription problem. © 2010 AI Access Foundation.




Lesaint, D., Mehta, D., O’Sullivan, B., Quesada, L., & Wilson, N. (2010). Developing approaches for solving a telecommunications feature subscription problem. Journal of Artificial Intelligence Research, 38, 271–305.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free