SCOPUS 정보 검색 플랫폼

JFPC 2008 - Actes des quatriemes Journees Francophones de Programmation par Contraintes

Volumn , Issue , 2008, Pages 115-122

Hybridization of constraint programming and a very large-scale neighborhood search for Eternity II;Hybridation de la programmation par contraintes et d'un voisinage à très grande taille pour Eternity II

(2) Schaus, Pierre a Deville, Yves a

a UNIVERSITÉ CATHOLIQUE DE LOUVAIN (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 80051924223 PISSN: None EISSN: None Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper

Times cited : (2)

References (11)

1
- 84867980790
- A survey of very large-scale neighborhood search techniques
- Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, and Abraham P. Punnen. A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics, 123(1-3):75-102, 2002.
- (2002) Discrete Applied Mathematics , vol.123 , Issue.1-3 , pp. 75-102
- Ahuja, R.K.¹ Ergun, O.² Orlin, J.B.³ Punnen, A.P.⁴

2
- 18944390206
- An optimal coarse-grained arc consistency algorithm
- Christian Bessière, Jean-Charles Régin, Roland H. C. Yap, and Yuanlin Zhang. An optimal coarse-grained arc consistency algorithm. Artif. Intell., 165(2):165-185, 2005.
- (2005) Artif. Intell. , vol.165 , Issue.2 , pp. 165-185
- Bessière, C.¹ Régin, J.-C.² Yap Roland, H.C.³ Zhang, Y.⁴

3
- 84876178211
- Assignment problems
- R. Burkard, M. DellAmico, and S. Martello. Assignment Problems. SIAM Monographs on Discrete Mathematics and Applications, 2008.
- (2008) SIAM Monographs on Discrete Mathematics and Applications
- Burkard, R.¹ DellAmico, M.² Martello, S.³

4
- 34547295064
- Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
- Erik D. Demaine and Martin L. Demaine. Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity. Graph. Comb., 23(1):195-208, 2007.
- (2007) Graph. Comb. , vol.23 , Issue.1 , pp. 195-208
- Demaine, E.D.¹ Demaine, M.L.²

5
- 0004215426
- Kluwer Boston, Inc.
- Fred Glover. Tabu Search. Kluwer Boston, Inc., 1998.
- (1998) Tabu Search
- Glover, F.¹

6
- 84983198316
- Generality versus specificity: An experience with ai and or techniques
- Van Hentenryck P. and Carillon J.-P. Generality versus specificity: an experience with ai and or techniques. In Proceedings of AAAI-88, 1988.
- (1988) Proceedings of AAAI-88
- Van Hentenryck, P.¹ Carillon, J.-P.²

7
- 33846019176
- Impact-based search strategies for constraint programming
- Philippe Refalo. Impact-based search strategies for constraint programming. In CP, pages 557-571, 2004.
- (2004) CP , pp. 557-571
- Refalo, P.¹

8
- 0028567611
- A filtering algorithm for constraints of difference in csps
- Menlo Park, CA, USA American Association for Artificial Intelligence
- Jean-Charles Régin. A filtering algorithm for constraints of difference in csps. In AAAI '94: Proceedings of the twelfth national conference on Artificial intelligence (Vol. 1), pages 362-367, Menlo Park, CA, USA, 1994. American Association for Artificial Intelligence.
- (1994) AAAI '94: Proceedings of the Twelfth National Conference on Artificial Intelligence , vol.1 , pp. 362-367
- Régin, J.-C.¹

9
- 33748706709
- Elsevier Science Inc., New York, NY, USA
- Francesca Rossi, Peter van Beek, and Toby Walsh. Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc., New York, NY, USA, 2006.
- (2006) Handbook of Constraint Programming (Foundations of Artificial Intelligence)
- Rossi, F.¹ Van Beek, P.² Walsh, T.³

10
- 33745646746
- Tetravex is np-complete
- Yasuhiko Takenaga and Toby Walsh. Tetravex is np-complete. Inf. Process. Lett., 99(5):171-174, 2006.
- (2006) Inf. Process. Lett. , vol.99 , Issue.5 , pp. 171-174
- Takenaga, Y.¹ Walsh, T.²

11
- 67650118605
- Gecode Team. Gecode: Generic constraint development environment. available from http://www.gecode.org.2006.
- Gecode: Generic Constraint Development Environment

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.