Solution-Based Phase Saving for CP: A Value-Selection Heuristic to Simulate Local Search Behavior in Complete Solvers-Reference-Cited by-同舟云学术

Solution-Based Phase Saving for CP: A Value-Selection Heuristic to Simulate Local Search Behavior in Complete Solvers

Published:2018 Issue: Volume: Page:99-108
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Demirović Emir,Chu Geoffrey,Stuckey Peter J.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-98334-9_7

Reference15 articles.

1. Roig, I.A.: Solving hard industrial combinatorial problems with SAT. Ph.D. thesis, Technical University of Catalonia (UPC) (2013)

2. Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Proceedings of ECAI 2004, pp. 146–150 (2004)

3. Carchrae, T., Beck, J.C.: Principles for the design of large neighborhood search. J. Math. Model. Algorithms 8(3), 245–270 (2009)

4. Chu, G.: Improving combinatorial optimization. Ph.D. thesis, The University of Melbourne (2011)

5. Haralick, R., Elliott, G.: Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14, 263–313 (1980)

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

1. Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding;Theoretical Computer Science;2023-09

2. Virtual Pairwise Consistency in Cost Function Networks;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2023

3. A hybrid CP/MOLS approach for multi-objective imbalanced classification;Proceedings of the Genetic and Evolutionary Computation Conference;2021-06-26

4. Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search;Constraints;2021-01-18

5. Constraint programming model for multi-manned assembly line balancing problem;Computers & Operations Research;2020-12