A fast approximate implementation of the work function algorithm for solving the -server problem

In this paper we propose an approximate implementation of the work function algorithm (WFA) for solving the [Formula omitted]-server problem. Our implementation is based on network flow techniques, a novel network model, and flow cost reduction. Also, it is provided with a parameter that enables tra...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Central European journal of operations research Ročník 23; číslo 3; s. 699 - 722
Hlavní autori: Rudec, Tomislav, Manger, Robert
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Heidelberg Springer 01.09.2015
Springer Nature B.V
Predmet:
Accuracy
Algorithms
Approximation
Cost reduction
Heuristic programming
Mathematical models
Networks
Operations research
Servers
Texts
Work functions
Croatia
ISSN:1435-246X, 1613-9178
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper we propose an approximate implementation of the work function algorithm (WFA) for solving the [Formula omitted]-server problem. Our implementation is based on network flow techniques, a novel network model, and flow cost reduction. Also, it is provided with a parameter that enables tradeoff between accuracy and speed. In the paper we present experiments, showing that the new implementation can mimic perfectly the original WFA and still run at least an order of magnitude faster than any known exact implementation.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1435-246X
1613-9178
DOI:10.1007/s10100-014-0349-4