Sciweavers

883 search results - page 2 / 177
» A Genetic Algorithm Applied to the Maximum Flow Problem
Sort
View
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
13 years 6 months ago
Parsimonious regularization using genetic algorithms applied to the analysis of analytical ultracentrifugation experiments
Frequently in the physical sciences experimental data are analyzed to determine model parameters using techniques known as parameter estimation. Eliminating the effects of noise ...
Emre H. Brookes, Borries Demeler
ICHIT
2009
Springer
13 years 11 months ago
A genetic algorithm approach for a constrained employee scheduling problem as applied to employees at mall type shops
In this application of artificial intelligence to a real-world problem, the constrained scheduling of employee resourcing for a mall type shop is solved by means of a genetic algo...
Adrian Brezulianu, Monica Fira, Lucian Fira
ESWA
2008
162views more  ESWA 2008»
13 years 4 months ago
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
Der-Fang Shiau, Shu-Chen Cheng, Yueh-Min Huang
12
Voted
NETWORKS
2006
13 years 4 months ago
The multiroute maximum flow problem revisited
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
Donglei Du, R. Chandrasekaran
SAC
2004
ACM
13 years 10 months ago
Solving the maximum clique problem by k-opt local search
This paper presents a local search algorithm based on variable depth search, called the k-opt local search, for the maximum clique problem. The k-opt local search performs add and...
Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihis...