Core-Guided and Core-Boosted Search for CP-Reference-Cited by-同舟云学术

Core-Guided and Core-Boosted Search for CP

Published:2020 Issue: Volume: Page:205-221
ISSN:0302-9743
Container-title:Integration of Constraint Programming, Artificial Intelligence, and Operations Research
language:
Short-container-title:

Author:

Gange Graeme,Berg Jeremias,Demirović Emir,Stuckey Peter J.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-58942-4_14

Reference26 articles.

1. Andres, B., Kaufmann, B., Matheis, O., Schaub, T.: Unsatisfiability-based optimization in clasp. In: Proceedings of the ICLP Technical Communications. LIPIcs, vol. 17, pp. 211–221. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)

2. Lecture Notes in Computer Science;C Ansótegui,2012

3. Ansótegui, C., Gabàs, J.: WPM3: An (in)complete algorithm for weighted partial MaxSAT. Artif. Intell. 250, 37–57 (2017)

4. Lecture Notes in Computer Science;R Asín,2009

5. Lecture Notes in Computer Science;F Bacchus,2014

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

1. Core Boosting in SAT-Based Multi-objective Optimization;Lecture Notes in Computer Science;2024

2. Certified Core-Guided MaxSAT Solving;Automated Deduction – CADE 29;2023

3. Branch-and-cut-and-price for the Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations;Computers & Operations Research;2022-09

4. Coupling Different Integer Encodings for SAT;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2022

5. Boosting branch-and-bound MaxSAT solvers with clause learning;AI Communications;2021-12-23