1054 search results - page 84 / 211 » Capacitated Domination Problem |
118
click to vote
SODA
2003
ACM
15 years 4 months ago
2003
ACM
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
103
click to vote
SIGECOM
2006
ACM
15 years 9 months ago
2006
ACM
Bidders on eBay have no dominant bidding strategy when faced with multiple auctions each offering an item of interest. As seen through an analysis of 1,956 auctions on eBay for a...
127
click to vote
COR
2011
14 years 10 months ago
2011
In this paper we make a comparative study of several mixed integer linear programming (MILP) formulations for resource-constrained project scheduling problems (RCPSPs). First, we ...
110
click to vote
ICCAD
1994
IEEE
15 years 7 months ago
1994
IEEE
In this paper, we study the simultaneousdriver and wire sizing (SDWS) problem under two objective functions: (i) delay minimization only, or (ii) combined delay and power dissipat...
EOR
2006
15 years 3 months ago
2006
Recent work on the location of perinatal facilities in the municipality of Rio de Janeiro resulted in the development of an uncapacitated, three-level hierarchical model. An impor...