An Efficient Local Search for Partial Latin Square Extension Problem-Reference-Cited by-同舟云学术

An Efficient Local Search for Partial Latin Square Extension Problem

Published:2015 Issue: Volume: Page:182-198
ISSN:0302-9743
Container-title:Integration of AI and OR Techniques in Constraint Programming
language:
Short-container-title:

Author:

Haraguchi Kazuya

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-18008-3_13

Reference39 articles.

1. Alidaee, B., Kochenberger, G., Wang, H.: Simple and fast surrogate constraint heuristics for the maximum independent set problem. J. Heuristics 14, 571–585 (2008)

2. Andrade, D., Resende, M., Werneck, R.: Fast local search for the maximum independent set problem. J. Heuristics 18, 525–547 (2012). the preliminary version appeared in Proc. 7th WEA (LNCS vol. 5038), pp. 220–234 (2008)

3. Ansótegui, C., Val, A., Dotú, I., Fernández, C., Manyá, F.: Modeling choices in quasigroup completion: SAT vs. CSP. In: Proc. National Conference on Artificial Intelligence, pp. 137–142 (2004)

4. Appa, G., Magos, D., Mourtos, I.: Searching for mutually orthogonal latin squares via integer and constraint programming. European J. Operational Research 173(2), 519–530 (2006)

5. Barry, R.A., Humblet, P.A.: Latin routers, design and implementation. IEEE/OSA J. Lightwave Technology 11(5), 891–899 (1993)

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

1. Improving Integer and Constraint Programming for Graeco-Latin Squares;2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI);2021-11

2. Iterated local search with Trellis-neighborhood for the partial Latin square extension problem;Journal of Heuristics;2016-09-23