MaxSAT-Based Scheduling of B2B Meetings

  • Miquel BofillEmail author
  • Marc Garcia
  • Josep Suy
  • Mateu Villaret
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9075)


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.


Time Slot Constraint Programming Soft Constraint Cardinality Constraint Sorting Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abío, I., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E.: A parametric approach for smaller and better encodings of cardinality constraints. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 80–96. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  2. 2.
    Achá, R.J.A., Nieuwenhuis, R.: Curriculum-based course timetabling with SAT and MaxSAT. Annals OR 218(1), 71–91 (2014)CrossRefzbMATHGoogle Scholar
  3. 3.
    Bofill, M., Espasa, J., Garcia, M., Palahí, M., Suy, J., Villaret, M.: Scheduling B2B meetings. In: O’Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 781–796. Springer, Heidelberg (2014) CrossRefGoogle Scholar
  4. 4.
    Bofill, M., Palahí, M., Suy, J., Villaret, M.: Solving intensional weighted CSPs by incremental optimization with BDDs. In: O’Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 207–223. Springer, Heidelberg (2014) CrossRefGoogle Scholar
  5. 5.
    Demirović, E., Musliu, N.: Modeling high school timetablingas partial weighted MaxSAT. In: LaSh: The 4th Workshop on Logic and Search (a SAT / ICLP workshop at FLoC 2014). Austria, Vienna (2014)Google Scholar
  6. 6.
    Dutertre, B., de Moura, L.: The Yices SMT solver. Tool paper, August 2006. (Accessed 23 November 2014)
  7. 7.
    Gebser, M., Glase, T., Sabuncu, O., Schaub, T.: Matchmaking with answer set programming. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol. 8148, pp. 342–347. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  8. 8.
    Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: clasp: A conflict-driven answer set solver. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 260–265. Springer, Heidelberg (2007) CrossRefGoogle Scholar
  9. 9.
    Klieber, W., Kwon, G.: Efficient CNF encoding for selecting 1 from N objects. In: Fourth Workshop on Constraints in Formal Verification, CFV (2007)Google Scholar
  10. 10.
    Koshimura, M., Zhang, T., Fujita, H., Hasegawa, R.: QMaxSAT: A Partial Max-SAT Solver. Journal on Satisfiability, Boolean Modeling and Computation 8(1/2), 95–100 (2012)MathSciNetGoogle Scholar
  11. 11.
    Li, C.M., Manyà, F.: Handbook of Satisfiability, chapter MaxSAT, Hard and Soft Constraints, pp. 613–631. IOS Press (2009)Google Scholar
  12. 12.
    Sinz, C.: Towards an optimal cnf encoding of boolean cardinality constraints. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 827–831. Springer, Heidelberg (2005) CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Miquel Bofill
    • 1
    Email author
  • Marc Garcia
    • 1
  • Josep Suy
    • 1
  • Mateu Villaret
    • 1
  1. 1.Departament d’Informàtica, Matemàtica Aplicada i EstadísticaUniversitat de GironaGironaSpain

Personalised recommendations