Sciweavers

2489 search results - page 109 / 498
» On the Subgroup Distance Problem
Sort
View
MP
2006
138views more  MP 2006»
15 years 3 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...
141
Voted
GECCO
2009
Springer
199views Optimization» more  GECCO 2009»
15 years 8 months ago
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
Jean-Baptiste Mouret, Stéphane Doncieux
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 7 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
CORR
2010
Springer
180views Education» more  CORR 2010»
15 years 1 months ago
Shortest path problem in rectangular complexes of global nonpositive curvature
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
Victor Chepoi, Daniela Maftuleac
111
Voted
SPIRE
2000
Springer
15 years 7 months ago
Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D Arrays
We consider the problem of defining and evaluating the distance between three
Kimmo Fredriksson, Esko Ukkonen