Qos-aware service evaluation and selection
From MaRDI portal
Publication:932236
DOI10.1016/j.ejor.2007.07.015zbMath1161.90371OpenAlexW2021786400MaRDI QIDQ932236
Dimitrios Tsesmetzis, Efstathios Sykas, Ioanna Roussaki
Publication date: 10 July 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.07.015
integer programmingprofit maximisationQoS-aware service selectionselective multiple choice knapsack problem
Integer programming (90C10) Linear programming (90C05) Queues and service in operations research (90B22)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiple attribute decision making. Methods and applications. A state-of- the-art survey
- A minimal algorithm for the multiple-choice knapsack problem
- Optimal triangulation and quadric-based surface simplification
- An Algorithm for Large Zero-One Knapsack Problems
- The greedy coloring is a bad probabilistic algorithm
- Computing Partitions with Applications to the Knapsack Problem
- The Multiple-Choice Knapsack Problem
- Discrete-Variable Extremum Problems
- Quicksort
This page was built for publication: Qos-aware service evaluation and selection