Sciweavers

1054 search results - page 23 / 211
» Capacitated Domination Problem
Sort
View
MP
1998
105views more  MP 1998»
15 years 2 months ago
Capacitated facility location: Separation algorithms and computational experience
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
Karen Aardal
TIM
2010
112views Education» more  TIM 2010»
14 years 9 months ago
Helmholtz-Type Regularization Method for Permittivity Reconstruction Using Experimental Phantom Data of Electrical Capacitance T
Electrical capacitance tomography (ECT) attempts to image the permittivity distribution of an object by measuring the electrical capacitance between sets of electrodes placed aroun...
Manuchehr Soleimani, Phaneendra K. Yalavarthy, Ham...
SODA
2010
ACM
172views Algorithms» more  SODA 2010»
15 years 11 months ago
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
Aparna Das, Claire Mathieu
AAAI
1998
15 years 3 months ago
An Integer Local Search Method with Application to Capacitated Production Planning
Production planning is an important task in manufacturing systems. We consider a real-world capacitated lot-sizing problem (CLSP) from the process industry. Because the problem re...
Joachim P. Walser, Ramesh Iyer, Narayan Venkatasub...
127
Voted
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
15 years 2 months ago
A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
Fabrizio Grandoni, Jochen Könemann, Alessandr...