1054 search results - page 73 / 211 » Capacitated Domination Problem |
103
click to vote
MP
2006
15 years 3 months ago
2006
A variety of integer programming formulations have been proposed for Vehicle Routing Problems (VRPs), including the so-called two- and three-index formulations, the set partitioni...
116
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
This paper studies an extension of the k-median problem where we are given a metric space (V, d) and not just one but m client sets {Si V }m i=1, and the goal is to open k facili...
122
click to vote
EUSFLAT
2007
15 years 4 months ago
2007
We investigate in this paper the set of kadditive capacities dominating a given capacity, which we call the k-additive core. We study its structure through achievable families, wh...
100
click to vote
ESA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
150
click to vote
APPROX
2005
Springer
15 years 8 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...