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...

Full description

Saved in:
Bibliographic Details
Published in:Central European journal of operations research Vol. 23; no. 3; pp. 699 - 722
Main Authors: Rudec, Tomislav, Manger, Robert
Format: Journal Article
Language:English
Published: Heidelberg Springer 01.09.2015
Springer Nature B.V
Subjects:
Accuracy
Algorithms
Approximation
Cost reduction
Heuristic programming
Mathematical models
Networks
Operations research
Servers
Texts
Work functions
Croatia
ISSN:1435-246X, 1613-9178
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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