Sciweavers

16404 search results - page 466 / 3281
» A set coverage problem
Sort
View
JCO
2007
80views more  JCO 2007»
15 years 6 months ago
The wireless network jamming problem
In adversarial environments, disabling the communication capabilities of the enemy is a high priority. We introduce the problem of determining the optimal number and locations for ...
Clayton W. Commander, Panos M. Pardalos, Valeriy R...
EOR
2002
105views more  EOR 2002»
15 years 6 months ago
Two-dimensional packing problems: A survey
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
Andrea Lodi, Silvano Martello, Michele Monaci
HEURISTICS
2002
155views more  HEURISTICS 2002»
15 years 6 months ago
Bounds and Heuristics for the Shortest Capacitated Paths Problem
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
Marie-Christine Costa, Alain Hertz, Michel Mittaz
AMC
1999
102views more  AMC 1999»
15 years 6 months ago
Analysis and approximation of optimal control problems for first-order elliptic systems in three dimensions
We examine analytical and numerical aspects of optimal control problems for firstorder elliptic systems in three dimensions. The particular setting we use is that of divcurl syste...
Max Gunzburger, Hyung-Chun Lee
TCAD
2002
110views more  TCAD 2002»
15 years 6 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...