Sciweavers

28 search results - page 1 / 6
» A fast swap-based local search procedure for location proble...
Sort
View
ANOR
2007
58views more  ANOR 2007»
13 years 7 months ago
A fast swap-based local search procedure for location problems
We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same outpu...
Mauricio G. C. Resende, Renato Fonseca F. Werneck
ICRA
2006
IEEE
87views Robotics» more  ICRA 2006»
14 years 1 months ago
Fast Localization of Avalanche Victims using Sum of Gaussians
— The probability of finding alive a person buried by a snow avalanche decreases dramatically with time. The best chance for the victims is to carry an avalanche beacon or ARVA ...
Pedro Pinies, Juan D. Tardós
CVPR
2009
IEEE
15 years 2 months ago
Fast concurrent object localization and recognition
Object localization and classification are important problems in computer vision. However, in many applications, exhaustive search over all class labels and image locations is co...
Tom Yeh, John J. Lee, Trevor Darrell
HM
2005
Springer
140views Optimization» more  HM 2005»
14 years 1 months ago
Fast Ejection Chain Algorithms for Vehicle Routing with Time Windows
Abstract. This paper introduces a new algorithm, based on the concept of ejection chains, to effectively target vehicle routing problems with time window constraints (VRPTW). Ejec...
Herman Sontrop, Pieter van der Horn, Marc Uetz
EOR
2008
133views more  EOR 2008»
13 years 7 months ago
Investigating a hybrid simulated annealing and local search algorithm for constrained optimization
Constrained Optimization Problems (COP) often take place in many practical applications such as kinematics, chemical process optimization, power systems and so on. These problems ...
Chandra Sekhar Pedamallu, Linet Özdamar