Sciweavers

16504 search results - page 282 / 3301
» New Problems, New Solutions
Sort
View
CEC
2010
IEEE
15 years 6 months ago
Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem
— Capacitated arc routing problem (CARP) has attracted much attention due to its generality to many real world problems. Memetic algorithm (MA), among other metaheuristic search ...
Liang Feng, Yew-Soon Ong, Quang Huy Nguyen 0001, A...
CORR
2010
Springer
99views Education» more  CORR 2010»
15 years 6 months ago
Locating phase transitions in computationally hard problems
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
B. Ashok, T. K. Patra
EOR
2007
90views more  EOR 2007»
15 years 6 months ago
Accelerating column generation for variable sized bin-packing problems
In this paper, we study different strategies to stabilize and accelerate the column generation method, when it is applied specifically to the variable sized bin-packing problem,...
Cláudio Alves, José M. Valéri...
SIAMSC
2008
142views more  SIAMSC 2008»
15 years 6 months ago
A Fast Direct Solver for the Biharmonic Problem in a Rectangular Grid
We present a fast direct solver methodology for the Dirichlet biharmonic problem in a rectangle. The solver is applicable in the case of the second order Stephenson scheme [34] as ...
Matania Ben-Artzi, Jean-Pierre Croisille, Dalia Fi...
DAM
2000
137views more  DAM 2000»
15 years 6 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...