[Bes94] Julian Besag. Comments on "representations of knowledge in complex systems" by u. grenander and mi miller. J. Roy. Statist. Soc. Ser. B, 56(591-592):4, 1994. 10
[BLP21] Yoshua Bengio, Andrea Lodi, and Antoine Prouvost. Machine learning for combinatorial optimization: a methodological tour d'horizon. European Journal of Operational Research, 290(2):405-421, 2021. 5
[BPL+16] Irwan Bello, Hieu Pham, Quoc V Le, Mohammad Norouzi, and Samy Bengio. Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940, 2016. 1, 2, 3, 5
$\left[\mathrm{CCK}^{+}21\right]$  Quentin Cappart, Didier Chételat, Elias Khalil, Andrea Lodi, Christopher Morris, and Petar Velicković. Combinatorial optimization and reasoning with graph neural networks. arXiv preprint arXiv:2102.09544, 2021. 5
$\left[\mathrm{CGG}^{+}19\right]$  Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, and Eric Vigoda. Fast algorithms at low temperatures via markov chains. arXiv preprint arXiv:1901.06653, 2019. 27
[CGKM22] Sitan Chen, Aravind Gollakota, Adam Klivans, and Raghu Meka. Hardness of noise-free learning for two-hidden-layer neural networks. Advances in Neural Information Processing Systems, 35:10709-10724, 2022. 5
[CLS+95] William Cook, László Lovász, Paul D Seymour, et al. Combinatorial optimization: papers from the DIMACS Special Year, volume 20. American Mathematical Soc., 1995. 1, 5
[CLV22] Zongchen Chen, Kuikui Liu, and Eric Vigoda. Spectral independence via stability and applications to holant-type problems. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pages 149–160. IEEE, 2022. 27
[COLMS22] Amin Coja-Oghlan, Philipp Loick, Balázs F Mezei, and Gregory B Sorkin. The ising antiferromagnet and max cut on random regular graphs. SIAM Journal on Discrete Mathematics, 36(2):1306-1342, 2022. 27
[CT19] Xinyun Chen and Yuandong Tian. Learning to perform local rewriting for combinatorial optimization. Advances in Neural Information Processing Systems, 32, 2019. 5
[CZ22] Xiaoyu Chen and Xinyuan Zhang. A near-linear time sampler for the ising model. arXiv preprint arXiv:2207.09391, 2022. 27
[d'A08] Alexandre d'Aspremont. Smooth optimization with approximate gradient. SIAM Journal on Optimization, 19(3):1171-1183, 2008. 28
[DAT20] Arthur Delarue, Ross Anderson, and Christian Tjandraatmadja. Reinforcement learning with combinatorial actions: An application to vehicle routing. Advances in Neural Information Processing Systems, 33:609-620, 2020. 5
[DCL+18] Michel Deudon, Pierre Cournut, Alexandre Lacoste, Yossiri Adulyasak, and Louis-Martin Rousseau. Learning heuristics for the tsp by policy gradient. In International conference on the integration of constraint programming, artificial intelligence, and operations research, pages 170-181. Springer, 2018. 5
[DLS22] Alexandru Damian, Jason Lee, and Mahdi Soltanolkotabi. Neural networks can learn representations with gradient descent. In Conference on Learning Theory, pages 5413-5452. PMLR, 2022. 5
[DMS17] Amir Dembo, Andrea Montanari, and Subhabrata Sen. Extremal cuts of sparse random graphs. The Annals of Probability, 45(2):1190-1217, 2017. 10
[dPS97] JC Angles d'Auriac, M Preissmann, and A Sebo. Optimal cuts in graphs and statistical mechanics. Mathematical and Computer Modelling, 26(8-10):1-11, 1997. 27
[Edm65] Jack Edmonds. Maximum matching and a polyhedron with 0, 1-vertices. Journal of research of the National Bureau of Standards B, 69(125-130):55-56, 1965. 29