期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 191, 期 3, 页码 1101-1112出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2007.07.015
关键词
integer programming; profit maximisation; QoS-aware service selection; selective multiple choice knapsack problem
Making the provision of services QoS-aware is to the advantage of both clients and providers in the e-business domain. This paper studies the problem of providers that receive multiple concurrent requests for services demonstrating different QoS properties. It introduces the Selective Multiple Choice Knapsack Problem that aims to identify the services, which should be delivered in order to maximise the provider's profit, subject to maximum bandwidth constraints. This problem is solved by a proposed algorithm that has been empirically evaluated via numerous experiments. (C) 2007 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据