Revisiting constraint-directed search
Tài liệu tham khảo
1997
Glover, 1993, Tabu search, 70
Kirkpatrick, 1983, Optimization by simulated annealing, Science, 220, 671, 10.1126/science.220.4598.671
Van Hentenryck, 2005
Michel, 2002, A constraint-based architecture for local search, ACM SIGPLAN Notices, 37, 101, 10.1145/583854.582430
M.S. Fox, Constraint-directed search: a case study of job-shop scheduling, Ph.D. thesis, Computer Science Department, Carnegie Mellon University, USA, December 1983.
J.P. Walser, Integer Optimization by Local Search: A Domain-Independent Approach, LNCS, vol. 1637, Springer-Verlag, 1999.
Ågren, 2007, Generic incremental algorithms for local search, Constraints, 12, 293, 10.1007/s10601-007-9021-0
M. Ågren, P. Flener, J. Pearson, Incremental algorithms for local search from existential second-order logic, in: P. van Beek (Ed.), Proceedings of CP’05, LNCS, vol. 3709, Springer-Verlag, 2005, pp. 47–61.
G. Tack, C. Schulte, G. Smolka, Generating propagators for finite set constraints, in: F. Benhamou (Ed.), Proceedings of CP’06, LNCS, vol. 4204, Springer-Verlag, 2006, pp. 575–589.
M. Ågren, P. Flener, J. Pearson, Inferring variable conflicts for local search, in: F. Benhamou (Ed.), Proceedings of CP’06, LNCS, vol. 4204, Springer-Verlag, 2006, pp. 665–669.
Smith, 1996, The progressive party problem: Integer linear programming and constraint programming compared, Constraints, 1, 119, 10.1007/BF00143880
P. Van Hentenryck, L. Michel, Differentiable invariants, in: F. Benhamou (Ed.), Proceedings of CP’06, LNCS, vol. 4204, Springer-Verlag, 2006, pp. 604–619.
I. Dotú, P. Van Hentenryck, Scheduling social golfers locally, in: R. Barták, M. Milano (Eds.), Proceedings of CP-AI-OR’05, LNCS, vol. 3524, Springer-Verlag, 2005.
Fang, 2007, The island confinement method for reducing search space in local search methods, Journal of Heuristics, 13, 557, 10.1007/s10732-007-9020-8
Minton, 1996, Automatically configuring constraint satisfaction programs: a case study, Constraints, 1, 7, 10.1007/BF00143877
M. Ågren, P. Flener, J. Pearson, On constraint-oriented neighbours for local search, Tech. Rep. 2007-009, Department of Information Technology, Uppsala University, Sweden, March 2007. Available from: <http://www.it.uu.se/research/reports/2007-009>.
M. Ågren, P. Flener, J. Pearson, Set variables and local search, in: R. Barták, M. Milano (Eds.), Proceedings of CP-AI-OR’05, LNCS, vol. 3524, Springer-Verlag, 2005, pp. 19–33.
Van Hentenryck, 2007, Synthesis of constraint-based local search algorithms from high-level models, 273
A. Nareyek, Using global constraints for local search, in: E. Freuder, R. Wallace (Eds.), Constraint Programming and Large Scale Discrete Optimization, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, vol. 57, American Mathematical Society, 2001, pp. 9–28.