Sciweavers

16596 search results - page 197 / 3320
» Generalized Assignment Problems
Sort
View
112
Voted
COR
2008
175views more  COR 2008»
15 years 2 months ago
Lower and upper bounds for a two-level hierarchical location problem in computer networks
In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacitie...
Aníbal Alberto Vilcapoma Ignacio, Virg&iacu...
CORR
2007
Springer
95views Education» more  CORR 2007»
15 years 2 months ago
Solving the subset-sum problem with a light-based device
We propose a special computational device which uses light rays for solving the subset-sum problem. The device has a graph-like representation and the light is traversing it by fol...
Mihai Oltean, Oana Muntean
EOR
2007
82views more  EOR 2007»
15 years 2 months ago
The equitable location problem on the plane
This paper considers the problem of locating M facilities on the unit square so as to minimize the maximal demand faced by each facility subject to closest assignments and coverag...
Opher Baron, Oded Berman, Dmitry Krass, Qian Wang
112
Voted
TCAD
2002
110views more  TCAD 2002»
15 years 2 months ago
A constructive genetic algorithm for gate matrix layout problems
This paper describes an application of a Constructive Genetic Algorithm (CGA) to the Gate Matrix Layout Problem (GMLP). The GMLP happens in very large scale integration (VLSI) desi...
Alexandre César Muniz de Oliveira, Luiz Ant...
TEC
2002
163views more  TEC 2002»
15 years 2 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon