Author:
Prud’homme Charles,Lorca Xavier,Jussien Narendra
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Software
Reference33 articles.
1. Atkins, K.E. (1989). An introduction to numerical analysis.
2. Cambazard, H, & Jussien, N (2006). Identifying and exploiting problem structures using explanation-based constraint programming. Constraints, 11 (4), 295–313.
3. Chabrier, A, Danna, E, Le Pape, C, Perron, L (2004). Solving a network design problem. Annals of Operations Research, 130 (1–4), 217–239.
4. Copado-Méndez, PJ, Blum, C, Guillén-Gosálbez, G, Jiménez, L (2013). Application of large neighborhood search to strategic supply chain management in the chemical industry. In Hybrid metaheuristics (pp. 335–352). Springer.
5. Danna, E, & Perron, L. (2003). Structured vs. unstructured large neighborhood search: A case study on job-shop scheduling problems with earliness and tardiness costs In Rossi, F (Ed.), Principles and practice of constraint programming? Lecture notes in computer science, CP 2003 (Vol. 2833, pp. 817–821). Berlin Heidelberg: Springer.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献