193 search results - page 5 / 39 » The Capacitated m-Ring-Star Problem |
INFORMS
2011
13 years 2 months ago
2011
IWPEC
2009
Springer
14 years 1 months ago
2009
Springer
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...
MP
2002
13 years 7 months ago
2002
Abstract. This paper provides an analysis of capacitated network design cut
WEA
2007
Springer
14 years 1 months 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...
DAC
2006
ACM
2006
ACM
A fast on-chip decoupling capacitance budgeting algorithm using macromodeling and linear programming
14 years 1 months 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...