Developing Approaches for Solving a Telecommunications Feature Subscription Problem
From MaRDI portal
Publication:3579356
DOI10.1613/JAIR.2992zbMATH Open1210.68014arXiv1401.3842OpenAlexW2099197681WikidataQ129559373 ScholiaQ129559373MaRDI QIDQ3579356
Author name not available (Why is that?)
Publication date: 6 August 2010
Published in: (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/1401.3842
No records found.
No records found.
This page was built for publication: Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579356)
