Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily

von Friedrich, Tobias
Veröffentlicht in SAT (24. : 2021 : Barcelona) Theory and Applications of Satisfiability Testing - SAT 2021 (2021)

The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability

von Bläsius, Thomas
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 1 of 4 (2021)

Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment Problem

von Peters, Jannik
Veröffentlicht in International Conference on Automated Planning and Scheduling (29. : 2019 : Berkeley, Calif.) Proceedings of the Twenty-ninth International Conference on Automated Planning and Scheduling (2019)