17 search results - page 1 / 4 » Heuristic and Exact Methods for the Discrete (r |p)-Centroid... |
EVOW
2010
Springer
13 years 6 months ago
2010
Springer
EVOW
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we study a complex real-world workforce scheduling problem. We propose a method of splitting the problem into smaller parts and solving each part using exhaustive sea...
ANOR
2011
13 years 18 days ago
2011
A vital task facing government agencies and commercial organizations that report data is to represent the data in a meaningful way and simultaneously to protect the confidentialit...
EUROCAST
2009
Springer
14 years 3 days ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
SAINT
2008
IEEE
13 years 12 months ago
2008
IEEE
We present a Variable Neighborhood Search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two diff...