193 search results - page 5 / 39 » The Capacitated m-Ring-Star Problem |
207
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
![Planar Capacitated Dominating Set Is W[1]-Hard](https://sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Planar Capacitated Dominating Set Is W[1]-Hard")
Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every...
217
Voted
MP
2002
15 years 6 months ago
2002
Abstract. This paper provides an analysis of capacitated network design cut
171
click to vote
WEA
2007
Springer
16 years 25 days ago
2007
Springer
This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have distinct capacities and costs. The colum...
196
Voted
DAC
2006
ACM
2006
ACM
A fast on-chip decoupling capacitance budgeting algorithm using macromodeling and linear programming
16 years 21 days ago
We propose a novel and efficient charge-based decoupling capacitance budgeting algorithm. Our method uses the macromodeling technique and effective radius of decoupling capacitan...