Sciweavers

78 search results - page 3 / 16
» Tabu Search Based Circuit Optimization
Sort
View
IJKESDP
2010
149views more  IJKESDP 2010»
13 years 5 months ago
An approximate solution method based on tabu search for k-minimum spanning tree problems
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishiz...
ATMOS
2010
162views Optimization» more  ATMOS 2010»
13 years 5 months ago
Heuristics for the Traveling Repairman Problem with Profits
In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists...
Thijs Dewilde, Dirk Cattrysse, Sofie Coene, Frits ...
CP
2009
Springer
14 years 8 months ago
Solving a Location-Allocation Problem with Logic-Based Benders' Decomposition
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
Mohammad M. Fazel-Zarandi, J. Christopher Beck
ICIAP
2005
ACM
14 years 7 months ago
Optimal Parameter Estimation for MRF Stereo Matching
Abstract. This paper presents an optimisation technique to select automatically a set of control parameters for a Markov Random Field applied to stereo matching. The method is base...
Riccardo Gherardi, Umberto Castellani, Andrea Fusi...
EVOW
2009
Springer
14 years 52 min ago
Finding Balanced Incomplete Block Designs with Metaheuristics
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
David Rodríguez Rueda, Carlos Cotta, Antoni...