Sciweavers

14739 search results - page 292 / 2948
» An optimization problem on the sphere
Sort
View
CDC
2009
IEEE
122views Control Systems» more  CDC 2009»
14 years 9 months ago
Reduced complexity models in the identification of dynamical networks: Links with sparsification problems
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be ...
Donatello Materassi, Giacomo Innocenti, Laura Giar...
CORR
2011
Springer
159views Education» more  CORR 2011»
14 years 6 months ago
Multicriteria Steiner Tree Problem for Communication Network
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
Mark Sh. Levin, Rustem I. Nuriakhmetov
SIAMJO
2010
110views more  SIAMJO 2010»
14 years 6 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng
TRANSCI
2010
169views more  TRANSCI 2010»
14 years 6 months ago
A Model and Algorithm for the Courier Delivery Problem with Uncertainty
We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with time windows in which customers appear probabilistically and their service times are uncert...
Ilgaz Sungur, Yingtao Ren, Fernando Ordó&nt...
TRANSCI
2010
98views more  TRANSCI 2010»
14 years 6 months ago
The Vehicle Routing Problem with Stochastic Demand and Duration Constraints
Time considerations have been largely ignored in the study of vehicle routing problems with stochastic demands, even though they are crucial in practice. We show that tour duratio...
Alan L. Erera, Juan C. Morales, Martin W. P. Savel...