A Kernighan-Lin inspired algorithm for MAX-SAT

被引：4
|
作者：
Bouhmala, Noureddine [1 ]
机构：
[1] Univ South Eastern Norway, Inst Microsyst, Dept Maritime Innovat & Technol, N-3184 Borre, Norway
来源：
SCIENCE CHINA-INFORMATION SCIENCES | 2019年 / 62卷 / 11期
关键词：
D O I：
10.1007/s11432-018-9786-2
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页数：3
相关论文
共 50 条
  • [1] A Kernighan-Lin inspired algorithm for MAX-SAT
    Noureddine BOUHMALA
    [J]. Science China(Information Sciences), 2019, 62 (11) : 206 - 208
  • [2] A Kernighan-Lin inspired algorithm for MAX-SAT
    Noureddine Bouhmala
    [J]. Science China Information Sciences, 2019, 62
  • [3] A MAX-SAT Algorithm Portfolio
    Matos, Paulo
    Planes, Jordi
    Letombe, Florian
    Marques-Silva, Joao
    [J]. ECAI 2008, PROCEEDINGS, 2008, 178 : 911 - +
  • [4] A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems
    Borchers B.
    Furman J.
    [J]. Journal of Combinatorial Optimization, 1998, 2 (4) : 299 - 306
  • [5] A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
    Borchers, B
    Furman, J
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 1999, 2 (04) : 299 - 306
  • [6] Evaluating the Kernighan-Lin heuristic for hardware/software partitioning
    Mann, Zoltan Adam
    Orban, Andras
    Farkas, Viktor
    [J]. INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE, 2007, 17 (02) : 249 - 267
  • [7] Network decomposition using Kernighan-Lin strategy aided harmony search algorithm
    Ezhilarasi, G. A.
    Swarup, K. S.
    [J]. SWARM AND EVOLUTIONARY COMPUTATION, 2012, 7 : 1 - 6
  • [8] Submodular Max-SAT
    Azar, Yossi
    Gamzu, Iftah
    Roth, Ran
    [J]. ALGORITHMS - ESA 2011, 2011, 6942 : 323 - 334
  • [9] Resolution for Max-SAT
    Bonet, Maria Luisa
    Levy, Jordi
    Manya, Felip
    [J]. ARTIFICIAL INTELLIGENCE, 2007, 171 (8-9) : 606 - 618
  • [10] Tight bound on Johnson's Algorithm for Max-SAT
    Chen, JE
    Friesen, DK
    Zheng, H
    [J]. TWELFTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1997, : 274 - 281
12345