Sciweavers

4966 search results - page 185 / 994
» its 2010
Sort
View
COR
2010
155views more  COR 2010»
15 years 6 months ago
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
The Multi-Compartment Vehicle Routing Problem (MC-VRP) consists of designing transportation routes to satisfy the demands of a set of costumers for several products that because o...
Jorge E. Mendoza, Bruno Castanier, Christelle Gu&e...
CSDA
2010
172views more  CSDA 2010»
15 years 6 months ago
Testing for two components in a switching regression model
We consider switching regression models with independent or Markov-dependent regime. Based on the modified likelihood ratio test (LRT) statistic by Chen, Chen and Kalbfleisch (200...
Jörn Dannemann, Hajo Holzmann
DAM
2010
103views more  DAM 2010»
15 years 6 months ago
Dynamic list coloring of bipartite graphs
A dynamic coloring of a graph is a proper coloring of its vertices such that every vertex of degree more than one has at least two neighbors with distinct colors. The least number...
Louis Esperet
EOR
2010
178views more  EOR 2010»
15 years 6 months ago
Facility location problems in the plane based on reverse nearest neighbor queries
For a finite set of points S, the (monochromatic) Reverse Nearest Neighbor (RNN) rule associates with any query point q the subset of points in S that have q as its nearest neighb...
Sergio Cabello, José Miguel Díaz-B&a...
EOR
2010
99views more  EOR 2010»
15 years 6 months ago
Min sum clustering with penalties
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
Refael Hassin, Einat Or