Fetching the paper…
Reading the bibliography…
Recently, machine learning, particularly message-passing graph neural networks (MPNNs), has gained traction in enhancing exact optimization algorithms.
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1992) · 1992
Earlier work this paper cites.
Multilayer feedforward networks with a nonpolynomial activation function can approximate any function
Leshno, M., Lin, V. Y., Pinkus, A., and Schocken, S. (1993) · 1993
Earlier work this paper cites.
Chemnet: A novel neural network based method for graph/property mapping
Kireev, D. B. (1995) · 1995
Earlier work this paper cites.
A neural device for searching direct correlations between structures and properties of chemical compounds
Baskin, I. I., Palyulin, V. A., and Zefirov, N. S. (1997) · 1997
Earlier work this paper cites.
Supervised neural networks for the classification of structures
Sperduti, A. and Starita, A. (1997) · 1997
Earlier work this paper cites.
Parameterizing branch-and-bound search trees to learn branching policies
Zarpellon, G., Jo, J., Lodi, A., and Bengio, Y. (2020) · 2002
Earlier work this paper cites.
Branching rules revisited
Achterberg, T., Koch, T., and Martin, A. (2005) · 2005
Earlier work this paper cites.
Automatic generation of complementary descriptors with molecular graph networks
Merkwirth, C. and Lengauer, T. (2005) · 2005
Earlier work this paper cites.
A new neural network model for contextual processing of graphs
Micheli, A. and Sestito, A. S. (2005) · 2005
Earlier work this paper cites.
Deepergcn: All you need to train deeper GCNs
Li, G., Xiong, C., Thabet, A., and Ghanem, B. (2020) · 2006
Earlier work this paper cites.
Numerical optimization
Nocedal, J. and Wright, S. J. (2006) · 2006
Earlier work this paper cites.
Further development of multiple centrality correctors for interior point methods
Colombo, M. and Gondzio, J. (2008) · 2008
Earlier work this paper cites.
Neural network for graphs: A contextual constructive approach
Micheli, A. (2009) · 2009
Earlier work this paper cites.
The graph neural network model
Scarselli, F., Gori, M., Tsoi, A. C., Hagenbuchner, M., and Monfardini, G. (2009) · 2009
Earlier work this paper cites.
Interior point methods 25 years later
Gondzio, J. (2012) · 2012
Earlier work this paper cites.
Solving mixed integer programs using neural networks
Nair, V., Bartunov, S., Gimeno, F., von Glehn, I., Lichocki, P., Lobov, I., O’Donoghue, B., Sonnerat, N., Tjandraatmadja, C., Wang, P., Addanki, R., Hapuarachchi, T., Keck, T., Keeling, J., Kohli, P., Ktena, I., Li, Y., Vinyals, O., and Zwols, Y. (2020) · 2012
Earlier work this paper cites.
Who invented the interior-point method?
Shanno, D. F. (2012) · 2012
Cited alongside, same era.
Spectral networks and deep locally connected networks on graphs
Bruna, J., Zaremba, W., Szlam, A., and LeCun, Y. (2014) · 2014
Cited alongside, same era.
Convolutional networks on graphs for learning molecular fingerprints
Duvenaud, D., Maclaurin, D., Aguilera-Iparraguirre, J., Gómez-Bombarelli, R., Hirzel, T., Aspuru-Guzik, A., and Adams, R. P. (2015) · 2015
Cited alongside, same era.
Adam: A method for stochastic optimization
Kingma, D. P. and Ba, J. (2015) · 2015
Cited alongside, same era.
Neural combinatorial optimization with reinforcement learning
Bello, I., Pham, H., Le, Q. V., Norouzi, M., and Bengio, S. (2016) · 2016
Cited alongside, same era.
Convolutional neural networks on graphs with fast localized spectral filtering
Hybrid models for learning to branch
Gupta, P., Gasse, M., Khalil, E. B., Mudigonda, P. K., Lodi, A., and Bengio, Y. (2020) · 2020
Later among the works it cites.
A general large neighborhood search framework for solving integer linear programs
Song, J., Lanka, R., Yue, Y., and Dilkina, B. (2020) · 2020
Later among the works it cites.
Neural execution of graph algorithms
Veličković, P., Ying, R., Padovano, M., Hadsell, R., and Blundell, C. (2020) · 2020
Later among the works it cites.
Machine learning for combinatorial optimization: A methodological tour d’horizon
Bengio, Y., Lodi, A., and Prouvost, A. (2021) · 2021
Later among the works it cites.
Combinatorial optimization and reasoning with graph neural networks
Cappart, Q., Chételat, D., Khalil, E. B., Lodi, A., Morris, C., and Veličković, P. (2021) · 2021
Later among the works it cites.
Learning to schedule heuristics in branch and bound
Chmiela, A., Khalil, E., Gleixner, A., Lodi, A., and Pokutta, S. (2021) · 2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Defferrard, M., Bresson, X., and Vandergheynst, P. (2016) · 2016
Cited alongside, same era.
Learning to branch in mixed integer programming
Khalil, E. B., Bodic, P. L., Song, L., Nemhauser, G. L., and Dilkina, B. (2016) · 2016
Cited alongside, same era.
Neural message passing for quantum chemistry
Gilmer, J., Schoenholz, S. S., Riley, P. F., Vinyals, O., and Dahl, G. E. (2017) · 2017
Cited alongside, same era.
Inductive representation learning on large graphs
Hamilton, W. L., Ying, Z., and Leskovec, J. (2017) · 2017
Cited alongside, same era.
Learning to run heuristics in tree search
Khalil, E. B., Dilkina, B., Nemhauser, G. L., Ahmed, S., and Shao, Y. (2017) · 2017
Cited alongside, same era.
Semi-supervised classification with graph convolutional networks
Kipf, T. N. and Welling, M. (2017) · 2017
Cited alongside, same era.
Graph attention networks
Veličković, P., Cucurull, G., Casanova, A., Romero, A., Liò, P., and Bengio, Y. (2018) · 2018
Cited alongside, same era.
Later among the works it cites.
End-to-end constrained optimization learning: A survey
Kotary, J., Fioretto, F., Van Hentenryck, P., and Wilder, B. (2021) · 2021
Later among the works it cites.
Lookback for learning to branch
Gupta, P., Khalil, E. B., Chételat, D., Gasse, M., Lodi, A., Bengio, Y., and Kumar, M. P. (2022) · 2022
Later among the works it cites.
MIP-GNN: A data-driven framework for guiding combinatorial solvers
Khalil, E. B., Morris, C., and Lodi, A. (2022) · 2022
Later among the works it cites.
Learning to reformulate for linear programming
Li, X., Qu, Q., Zhu, F., Zeng, J., Yuan, M., Mao, K., and Wang, J. (2022) · 2022
Later among the works it cites.
On representing linear programs by graph neural networks
Chen, Z., Liu, J., Wang, X., and Yin, W. (2023) · 2023
Closest in time.
Machine learning for cutting planes in integer programming: A survey
Deza, A. and Khalil, E. B. (2023) · 2023
Closest in time.
Smart initial basis selection for linear programs
Fan, Z., Wang, X., Yakovenko, O., Sivas, A. A., Ren, O., Zhang, Y., and Zhou, Z. (2023) · 2023
Closest in time.
Exact combinatorial optimization with temporo-attentional graph neural networks
Seyfi, M., Banitalebi-Dehkordi, A., Zhou, Z., and Zhang, Y. (2023) · 2023
Closest in time.
A deep learning approach for solving linear programming problems
Wu, D. and Lisser, A. (2023) · 2023
Closest in time.