## Abstract Heuristic methods, such as tabu search, are efficient for global optimizations. Most studies, however, have focused on constraint‐free optimizations. Penalty functions are commonly used to deal with constraints for global optimization algorithms in dealing with constraints. This is some
✦ LIBER ✦
A Combined Global & Local Search (CGLS) Approach to Global Optimization
✍ Scribed by U. M. Garcia-Palomares; F. J. Gonzalez-Castaño; J. C. Burguillo-Rial
- Publisher
- Springer US
- Year
- 2006
- Tongue
- English
- Weight
- 147 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0925-5001
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A combined global and local search metho
✍
Xi Chen; Jing Yang; Zhaohua Li; Daqing Tian; Zhijiang Shao
📂
Article
📅
2008
🏛
John Wiley and Sons
🌐
English
⚖ 269 KB
A local search method for continuous glo
✍
M. Gaviano; D. Lera; A. M. Steri
📂
Article
📅
2010
🏛
Springer US
🌐
English
⚖ 242 KB
A Matrix-Based Approach to Global Locali
✍
Mahmut Kandemir; Alok Choudhary; J. Ramanujam; Prith Banerjee
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 824 KB
Global locality optimization is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout transformations. Pure loop transformations are restricted by data dependencies and may not be very successful in optimizing imperfectly nested loo
Combining a Local Search and Grover’s Al
✍
D. W. Bulger
📂
Article
📅
2007
🏛
Springer
🌐
English
⚖ 341 KB
A polyhedral branch-and-cut approach to
✍
Mohit Tawarmalani; Nikolaos V. Sahinidis
📂
Article
📅
2005
🏛
Springer-Verlag
🌐
English
⚖ 253 KB
A response-modeling approach to global o
✍
Brian Rutherford
📂
Article
📅
2006
🏛
Springer US
🌐
English
⚖ 814 KB