Usage of Exact Algorithms to Enhance Stochastic Local Search Algorithms-Reference-Cited by-同舟云学术

Usage of Exact Algorithms to Enhance Stochastic Local Search Algorithms

Published:2009 Issue: Volume: Page:103-134
ISSN:1934-3221
Container-title:Matheuristics
language:
Short-container-title:

Author:

Dumitrescu Irina,Stützle Thomas

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-1-4419-1306-7_4.pdf

Reference114 articles.

1. E.H.L. Aarts and J.K. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley, & Songs, Chichester, 1997.

2. C.C. Aggarwal, J.B. Orlin, and R.P. Tai. An optimized crossover for the maximum independent set. Operations Research, 45:226–234, 1997.

3. R.K. Ahuja, Ö.Ergun, J.B. Orlin, and A.P. Punnen. A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics, 123(1–3):75–102, 2002.

4. R.K. Ahuja, Ö. Ergun, J.B. Orlin, and A.P. Punnen. Very large-scale neighborhood search: Theory, algorithms, and applications. In T.F. Gonzalez, editor, Handbook of Approximation Algorithms and Metaheuristics, pages 20–1—20–15. Chapman & Hall/CRC, Boca Raton, FL, 2007.

5. R.K. Ahuja, J.B. Orlin, and D. Sharma. Multi-exchange neighbourhood structures for the capacitated minimum spaning tree problem. Working Paper, 2000.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A matheuristic approach for the b-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic;European Journal of Operational Research;2021-11

2. A recombination-based matheuristic for mixed integer programming problems with binary variables;International Transactions in Operational Research;2018-03-23

3. Iterated Greedy;Handbook of Heuristics;2018

4. Iterated Greedy;Handbook of Heuristics;2017-10-05

5. A new hybrid matheuristic optimization algorithm for solving design and network engineering problems;International Journal of Management Science and Engineering Management;2017-02-07