Developing approaches for solving a telecommunications feature subscription problem

Simple item page
dc.contributor.authorLesaint, David
dc.contributor.authorMehta, Deepak
dc.contributor.authorO'Sullivan, Barry
dc.contributor.authorQuesada, Luis
dc.contributor.authorWilson, Nic
dc.contributor.funderScience Foundation Irelanden
dc.date.accessioned2013-04-30T16:58:53Z
dc.date.available2013-04-30T16:58:53Z
dc.date.copyright2010
dc.date.issued2010-06
dc.date.updated2012-12-20T17:33:59Z
dc.description.abstractCall 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.en
dc.description.statusPeer revieweden
dc.description.versionPublished Versionen
dc.format.mimetypeapplication/pdfen
dc.identifier.citationDavid 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.2992en
dc.identifier.doi10.1613/jair.2992
dc.identifier.endpage305en
dc.identifier.issn10769757
dc.identifier.journaltitleJournal of Artificial Intelligence Researchen
dc.identifier.startpage271en
dc.identifier.urihttps://hdl.handle.net/10468/1106
dc.identifier.volume38en
dc.language.isoenen
dc.publisherAI Access Foundationen
dc.relation.projectinfo:eu-repo/grantAgreement/SFI/SFI Technology and Innovation Development Award (TIDA)/05/IN.1/I886 TIDA 09/IE/Costraint Baset Energy Cost Efficient Scheduling/
dc.relation.projectinfo:eu-repo/grantAgreement/SFI/SFI Principal Investigator Programme (PI)/08/IN.1/I1912/IE/The Development of Artificial intelligence Approaches for Preferences in Combinational Problems/
dc.relation.urihttp://jair.org/papers/paper2992.html
dc.rights© 2010 AI Access Foundation.en
dc.subjectConfigurationen
dc.subjectSubscriptionen
dc.subjectFeedback vertex set problemen
dc.subjectNP-hard tasken
dc.subjectConstraint programmingen
dc.subjectBooleanen
dc.subjectMixed integer linear programmingen
dc.subject.lcshComputer science.en
dc.titleDeveloping approaches for solving a telecommunications feature subscription problemen
dc.typeArticle (peer-reviewed)en
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
LMOQW-JAIR-2010.pdf
Size:
355.71 KB
Format:
Adobe Portable Document Format
Description:
Published Version
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
2.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Computer Science - Journal Articles
Insight Centre for Data Analytics - Journal Articles