Automating cutting planes is NP-hard. Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. https://doi.org/10.1145/3357713.3384248
Chicago Style (17th ed.) Citation"Automating Cutting Planes Is NP-hard." Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing . https://doi.org/10.1145/3357713.3384248.
MLA (9th ed.) Citation"Automating Cutting Planes Is NP-hard." Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, , https://doi.org/10.1145/3357713.3384248.
Warning: These citations may not always be 100% accurate.