Sciweavers

89 search results - page 4 / 18
» A heuristic method for large-scale multi-facility location p...
Sort
View
ICIP
2010
IEEE
13 years 4 months ago
Reducing graphs in graph cut segmentation
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
Nicolas Lerme, François Malgouyres, Lucas L...
AUSAI
2005
Springer
14 years 8 days ago
A Multi-exchange Heuristic for a Production Location Problem
In this work, we develop a multi-exchange heuristic based on an estimation improvement graph embedded in a simulated annealing to solve a problem arising in plant location planning...
Yunsong Guo, Yanzhi Li, Andrew Lim, Brian Rodrigue...
COR
2004
85views more  COR 2004»
13 years 6 months ago
A heuristic method for large-scale multi-facility location problems
Abstract. A heuristic method for solving large-scale multi
Yuri Levin, Adi Ben-Israel
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
14 years 3 days ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
EOR
2006
129views more  EOR 2006»
13 years 6 months ago
Balancing assembly lines with tabu search
Balancing assembly lines is a crucial task for manufacturing companies in order to improve productivity and minimize production costs. Despite some progress in exact methods to so...
Sophie D. Lapierre, Angel B. Ruiz, Patrick Soriano