Developing approaches for solving a telecommunications feature subscription problem

Thumbnail Image
LMOQW-JAIR-2010.pdf(355.71 KB)
Published Version
Lesaint, David
Mehta, Deepak
O'Sullivan, Barry
Quesada, Luis
Wilson, Nic
Journal Title
Journal ISSN
Volume Title
AI Access Foundation
Published Version
Research Projects
Organizational Units
Journal Issue
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 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.
Configuration , Subscription , Feedback vertex set problem , NP-hard task , Constraint programming , Boolean , Mixed integer linear programming
David Lesaint, Deepak Mehta, Barry O'Sullivan, Luis Quesada, and Nic Wilson (2010) 'Developing Approaches for Solving a Telecommunications Feature Subscription Problem'. Journal of Artificial Intelligence Research, 38 :271-305. doi: 10.1613/jair.2992
Link to publisher’s version
© 2010 AI Access Foundation.