Efficient Local Search for Pseudo Boolean Optimization-Reference-Cited by-同舟云学术

Efficient Local Search for Pseudo Boolean Optimization

Published:2021 Issue: Volume: Page:332-348
ISSN:0302-9743
Container-title:Theory and Applications of Satisfiability Testing – SAT 2021
language:
Short-container-title:

Author:

Lei Zhendong,Cai Shaowei,Luo Chuan,Hoos Holger

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-80223-3_23

Reference24 articles.

1. Barth, P.: A Davis-Putnam enumeration algorithm for linear pseudo-Boolean optimization. In: Technical Report MPI-I-95-2-003. Max Plank Institute for Computer Science (1995)

2. Lecture Notes in Computer Science;J Berg,2019

3. Lecture Notes in Computer Science;J Berg,2017

4. Cai, S., Lei, Z.: Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability. Artif. Intell. 287, 103354 (2020)

5. Coudert, O., Madre, J.C.: New ideas for solving covering problems. In: Preas, B. (ed.) Proceedings of the 32st Conference on Design Automation, 1995, pp. 641–646. ACM Press (1995)

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

1. DeciLS-PBO: an effective local search method for pseudo-Boolean optimization;Frontiers of Computer Science;2023-11-25

2. Modeling of Decision-Making Processes in the Service Management System;2023 IEEE 18th International Conference on Computer Science and Information Technologies (CSIT);2023-10-19

3. An efficient local search algorithm for minimum positive influence dominating set problem;Computers & Operations Research;2023-06

4. Feasibility Jump: an LP-free Lagrangian MIP heuristic;Mathematical Programming Computation;2023-03-14

5. An improved master-apprentice evolutionary algorithm for minimum independent dominating set problem;Frontiers of Computer Science;2022-12-12