Abstract
In this work we deal with the problem of scheduling meetings between research groups, companies and investors in a scientific and technological forum. We provide a CP formulation and a Pseudo-Boolean formulation of the problem, and empirically test the performance of different solving techniques, such as CP, lazy clause generation, SMT, and ILP, on industrial and crafted instances of the problem. The solutions obtained clearly improve expert handmade solutions with respect to the number of idle time slots and other quality parameters.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
http://www.b2match.com (accessed April 11, 2014)
http://www.opturion.com (accessed April 11, 2014)
Abío, I., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E., Mayer-Eichberger, V.: A New Look at BDDs for Pseudo-Boolean Constraints. Journal of Artificial Intelligence Research (JAIR) 45, 443–480 (2012)
Achterberg, T.: SCIP: solving constraint integer programs. Mathematical Programming Computation 1(1), 1–41 (2009)
Ansótegui, C., Bofill, M., Palahí, M., Suy, J., Villaret, M.: W-MiniZinc: A Proposal for Modeling Weighted CSPs with MiniZinc. In: Proceedings of the 1st International Workshop on MiniZinc (MZN 2011) (2011)
Ansótegui, C., Bofill, M., Palahí, M., Suy, J., Villaret, M.: Solving weighted CSPs with meta-constraints by reformulation into Satisfiability Modulo Theories. Constraints 18(2), 236–268 (2013)
Ansótegui, C., Bonet, M.L., Levy, J.: Solving (Weighted) Partial MaxSAT through Satisfiability Testing. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 427–440. Springer, Heidelberg (2009)
Bofill, M., Espasa, J., Palahí, M., Villaret, M.: An extension to Simply for solving Weighted Constraint Satisfaction Problems with Pseudo-Boolean Constraints. In: XII Spanish Conference on Programming and Computer Languages (PROLE 2012), Almería, Spain, pp. 141–155 (September 2012)
Bofill, M., Palahí, M., Suy, J., Villaret, M.: Boosting Weighted CSP Resolution with Shared BDDs. In: Proceedings of the 12th International Workshop on Constraint Modelling and Reformulation (ModRef 2013), Uppsala, Sweden, pp. 57–73 (September 2013)
Dutertre, B., de Moura, L.: The Yices SMT solver (August 2006) Tool paper available at, http://yices.csl.sri.com/tool-paper.pdf (accessed April 11, 2014)
Even, S., Itai, A., Shamir, A.: On the complexity of time table and multi-commodity flow problems. In: Foundations of Computer Science, 16th Annual Symposium, pp. 184–193. IEEE (1975)
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)
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)
Manquinho, V., Marques-Silva, J., Planes, J.: Algorithms for Weighted Boolean Optimization. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 495–508. Springer, Heidelberg (2009)
Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.R.: MiniZinc: Towards a Standard CP Modelling Language. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529–543. Springer, Heidelberg (2007)
Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation via lazy clause generation. Constraints 14(3), 357–391 (2009)
Schulte, C., Lagerkvist, M., Tack, G.: Gecode. Software download and online material at the website (2006), http://www.gecode.org (accessed April 11, 2014)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Bofill, M., Espasa, J., Garcia, M., Palahí, M., Suy, J., Villaret, M. (2014). Scheduling B2B Meetings. In: O’Sullivan, B. (eds) Principles and Practice of Constraint Programming. CP 2014. Lecture Notes in Computer Science, vol 8656. Springer, Cham. https://doi.org/10.1007/978-3-319-10428-7_56
Download citation
DOI: https://doi.org/10.1007/978-3-319-10428-7_56
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10427-0
Online ISBN: 978-3-319-10428-7
eBook Packages: Computer ScienceComputer Science (R0)