159 search results - page 1 / 32 » Computing minimum cuts by randomized search heuristics |
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
ICRA
2000
IEEE
2000
IEEE
Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks
13 years 9 months ago
This paper deals with the Assembly Line Balancing Problem considering incompatibilities between the tasks with the aim of, first, minimizing the number of workstations and, then, ...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
INFORMS
2010
13 years 3 months ago
2010
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...
EVOW
2004
Springer
13 years 10 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...