241 search results - page 30 / 49 » Fast heuristics for large scale covering-location problems |
ARCS
2006
Springer
15 years 1 months ago
2006
Springer
State-of-the-art technologies in very large scale integration (VLSI) allow for the realization of gates with varying energy consumptions and hence delays (i.e., processing speeds) ...
NIPS
2007
14 years 11 months ago
2007
Guided by the goal of obtaining an optimization algorithm that is both fast and yields good generalization, we study the descent direction maximizing the decrease in generalizatio...
81
Voted
ANOR
2008
14 years 9 months ago
2008
Abstract Column generation techniques have become a widely used technique to successfully solve large (integer) linear programs. One of the keys to obtaining a practically efficien...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
69
Voted
LION
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The practical utility of optimization technologies is often impacted by factors that reflect how these tools are used in practice, including whether various real-world c...