MaxSAT-Based Scheduling of B2B Meetings

被引:12
作者
Bofill, Miquel [1 ]
Garcia, Marc [1 ]
Suy, Josep [1 ]
Villaret, Mateu [1 ]
机构
[1] Univ Girona, Dept Informat Matemat Aplicada & Estadist, Girona, Spain
来源
INTEGRATION OF AI AND OR TECHNIQUES IN CONSTRAINT PROGRAMMING | 2015年 / 9075卷
关键词
CONSTRAINTS;
D O I
10.1007/978-3-319-18008-3_5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this work we propose a MaxSAT formulation for the problem of scheduling business-to-business meetings. We identify some implied constraints and provide distinct encodings of the used cardinality constraints. The experimental results show that the proposed technique outperforms previous existing approaches on this problem.
引用
收藏
页码:65 / 73
页数:9
相关论文
共 12 条
  • [1] Abío I, 2013, LECT NOTES COMPUT SC, V8124, P80, DOI 10.1007/978-3-642-40627-0_9
  • [2] Curriculum-based course timetabling with SAT and MaxSAT
    Acha, Roberto Asin
    Nieuwenhuis, Robert
    [J]. ANNALS OF OPERATIONS RESEARCH, 2014, 218 (01) : 71 - 91
  • [3] [Anonymous], 2006, YICES SMT SOLVER
  • [4] Bofill M, 2014, LECT NOTES COMPUT SC, V8656, P781, DOI 10.1007/978-3-319-10428-7_56
  • [5] Bofill M, 2014, LECT NOTES COMPUT SC, V8656, P207, DOI 10.1007/978-3-319-10428-7_17
  • [6] Demirovic E., 2014, LASH
  • [7] clasp: A conflict-driven answer set solver
    Gebser, Martin
    Kaufmann, Benjamin
    Neumann, Andre
    Schaub, Torsten
    [J]. LOGIC PROGRAMMING AND NONMONOTONIC REASONING, PROCEEDINGS, 2007, 4483 : 260 - +
  • [8] Gebser M, 2013, LECT NOTES COMPUT SC, V8148, P342, DOI 10.1007/978-3-642-40564-8_34
  • [9] Klieber W., 2007, 4 WORKSH CONSTR FORM
  • [10] Koshimura M., 2012, Journal on Satisfiability, Boolean Modeling and Computation, V8, P95