Fetching the paper…
Reading the bibliography…
The rapid advancement of artificial intelligence (AI) techniques has opened up new opportunities to revolutionize various fields, including operations research (OR).
Understanding LSTM – A tutorial into long short-term memory recurrent neural networks
Staudemeyer, R. C. and Morris, E. R. (2019) · 1909
Earlier work this paper cites.
Asynchronous methods for deep reinforcement learning
Mnih, V., Badia, A. P., Mirza, M., Graves, A., Lillicrap, T. P., Harley, T., Silver, D., and Kavukcuoglu, K. (2016) · 1937
Earlier work this paper cites.
Portfolio selection
Markowitz, H. (1952) · 1952
Earlier work this paper cites.
An algorithm for the mixed integer problem
Gomory, R. (1960) · 1960
Earlier work this paper cites.
A tree-search algorithm for mixed integer programming problems
Dakin, R. J. (1965) · 1965
Earlier work this paper cites.
A formal basis for the heuristic determination of minimum cost paths
Hart, P. E., Nilsson, N. J., and Raphael, B. (1968) · 1968
Earlier work this paper cites.
Experiments in mixed-integer linear programming
Bénichou, M., Gauthier, J.-M., Girodet, P., Hentges, G., Ribière, G., and Vincent, O. (1971) · 1971
Earlier work this paper cites.
A method for solving the convex programming problem with convergence rate o ( 1 / k 2 ) o(1/k^{2})
Nesterov, Y. (1983) · 1983
Earlier work this paper cites.
The complexity of optimization problems
Krentel, M. W. (1986) · 1986
Earlier work this paper cites.
Mathematical programming formulations for machine scheduling: A survey
Blazewicz, J., Dror, M., and Weglarz, J. (1991) · 1991
Earlier work this paper cites.
Steepest-edge simplex algorithms for linear programming
Forrest, J. J. and Goldfarb, D. (1992) · 1992
Earlier work this paper cites.
Application of the alternating direction method of multipliers to separable convex programming problems
Fukushima, M. (1992) · 1992
Earlier work this paper cites.
Simple statistical gradient-following algorithms for connectionist reinforcement learning
Williams, R. J. (1992) · 1992
Earlier work this paper cites.
Finding cuts in the TSP (A preliminary report)
Applegate, D., Bixby, R., Chvátal, V., and Cook, W. (1995) · 1995
Earlier work this paper cites.
No free lunch theorems for optimization
Wolpert, D. H. and Macready, W. G. (1997) · 1997
Earlier work this paper cites.
A variable-penalty alternating directions method for convex optimization
Kontogiorgis, S. and Meyer, R. R. (1998) · 1998
Earlier work this paper cites.
Using constraint programming and local search methods to solve vehicle routing problems
Shaw, P. (1998) · 1998
Earlier work this paper cites.
An incremental gradient (-projection) method with momentum term and adaptive stepsize rule
Tseng, P. (1998) · 1998
Earlier work this paper cites.
A computational study of search strategies for mixed integer programming
Linderoth, J. T. and Savelsbergh, M. W. (1999) · 1999
Earlier work this paper cites.
Augmented Lagrangian methods: applications to the numerical solution of boundary-value problems
Fortin, M. and Glowinski, R. (2000) · 2000
Earlier work this paper cites.
Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
He, B., Yang, H., and Wang, S. (2000) · 2000
Earlier work this paper cites.
Recurrent neural networks
Medsker, L. R. and Jain, L. (2001) · 2001
Earlier work this paper cites.
Decomposition method with a variable parameter for a class of monotone variational inequality problems
Wang, S. and Liao, L. (2001) · 2001
Earlier work this paper cites.
Linear Programming 2: Theory and Extensions
Dantzig, G. B. and Thapa, M. N. (2003) · 2003
Earlier work this paper cites.
Local branching
Fischetti, M. and Lodi, A. (2003) · 2003
Earlier work this paper cites.
Modeling staff scheduling problems. A tutorial
Blöchliger, I. (2004) · 2004
Earlier work this paper cites.
Principles and applications of operations research
Rajgopal, J. (2004) · 2004
Earlier work this paper cites.
Revenue management under a general discrete choice model of consumer behavior
Talluri, K. T. and Van Ryzin, G. J. (2004) · 2004
Earlier work this paper cites.
Operations Research: Applications and Algorithms
Winston, W. L. and Goldberg, J. B. (2004) · 2004
Earlier work this paper cites.
Branching rules revisited
Achterberg, T., Koch, T., and Martin, A. (2005) · 2005
Earlier work this paper cites.
Language models are few-shot learners
Brown, T. B., Mann, B., Ryder, N., Subbiah, M., Kaplan, J., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., Agarwal, S., Herbert-Voss, A., Krueger, G., Henighan, T., Child, R., Ramesh, A., Ziegler, D. M., Wu, J., Winter, C., Hesse, C., Chen, M., Sigler, E., Litwin, M., Gray, S., Chess, B., Clark, J., Berner, C., McCandlish, S., Radford, A., Sutskever, I., and Amodei, D. (2020) · 2005
Earlier work this paper cites.
Exploring relaxation induced neighborhoods to improve MIP solutions
Danna, E., Rothberg, E. E., and Pape, C. L. (2005) · 2005
Earlier work this paper cites.
Column generation
Desaulniers, G., Desrosiers, J., and Solomon, M. M. (2006) · 2006
Earlier work this paper cites.
Improvement strategies for the f-race algorithm: Sampling design and iterative refinement
Balaprakash, P., Birattari, M., and Stützle, T. (2007) · 2007
Earlier work this paper cites.
A gender-based genetic algorithm for the automatic configuration of algorithms
Ansótegui, C., Sellmann, M., and Tierney, K. (2009) · 2009
Earlier work this paper cites.
Curriculum learning
Bengio, Y., Louradour, J., Collobert, R., and Weston, J. (2009) · 2009
Earlier work this paper cites.
V12. 1: User’s manual for CPLEX
CPLEX, I. I. (2009) · 2009
Earlier work this paper cites.
ParamILS: An automatic algorithm configuration framework
Hutter, F., Hoos, H. H., Leyton-Brown, K., and Stützle, T. (2009) · 2009
Earlier work this paper cites.
Metaheuristics: from design to implementation
Talbi, E.-G. (2009) · 2009
Earlier work this paper cites.
Proximal policy gradient: PPO with policy gradient
Byun, J., Kim, B., and Wang, H. (2020) · 2010
Earlier work this paper cites.
Automated configuration of mixed integer programming solvers
Hutter, F., Hoos, H. H., and Leyton-Brown, K. (2010) · 2010
Earlier work this paper cites.
An automatic method for solving discrete programming problems
Land, A. H. and Doig, A. G. (2010) · 2010
Earlier work this paper cites.
Efficient reductions for imitation learning
Ross, S. and Bagnell, D. (2010) · 2010
Earlier work this paper cites.
Distributed optimization and statistical learning via the alternating direction method of multipliers
Boyd, S., Parikh, N., Chu, E., Peleato, B., and Eckstein, J. (2011) · 2011
Earlier work this paper cites.
Adaptive subgradient methods for online learning and stochastic optimization
Duchi, J., Hazan, E., and Singer, Y. (2011) · 2011
Earlier work this paper cites.
Sequential model-based optimization for general algorithm configuration
Hutter, F., Hoos, H. H., and Leyton-Brown, K. (2011) · 2011
Earlier work this paper cites.
A probing algorithm for MINLP with failure prediction by SVM
Nannicini, G., Belotti, P., Lee, J., Linderoth, J., Margot, F., and Wächter, A. (2011) · 2011
Earlier work this paper cites.
Online team formation in social networks
Anagnostopoulos, A., Becchetti, L., Castillo, C., Gionis, A., and Leonardi, S. (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. (2021) · 2012
Earlier work this paper cites.
Guiding combinatorial optimization with UCT
Sabharwal, A., Samulowitz, H., and Reddy, C. (2012) · 2012
Earlier work this paper cites.
Auto-encoding variational bayes
Kingma, D. P. and Welling, M. (2013) · 2013
Earlier work this paper cites.
On the difficulty of training recurrent neural networks
Pascanu, R., Mikolov, T., and Bengio, Y. (2013) · 2013
Earlier work this paper cites.
Learning to search in branch and bound algorithms
He, H., Daume III, H., and Eisner, J. M. (2014) · 2014
Earlier work this paper cites.
Vehicle routing: problems, methods, and applications
Toth, P. and Vigo, D. (2014) · 2014
Earlier work this paper cites.
Package ‘lpsolve’
Berkelaar, M. (2015) · 2015
Earlier work this paper cites.
Adam: A method for stochastic optimization
Kingma, D. P. and Ba, J. (2015) · 2015
Cited alongside, same era.
Trust region policy optimization
Schulman, J., Levine, S., Abbeel, P., Jordan, M. I., and Moritz, P. (2015) · 2015
Cited alongside, same era.
Learning to learn by gradient descent by gradient descent
Andrychowicz, M., Denil, M., Colmenarejo, S. G., Hoffman, M. W., Pfau, D., Schaul, T., and de Freitas, N. (2016) · 2016
Cited alongside, same era.
ASlib: A benchmark library for algorithm selection
Bischl, B., Kerschke, P., Kotthoff, L., Lindauer, M., Malitsky, Y., Fréchette, A., Hoos, H., Hutter, F., Leyton-Brown, K., Tierney, K., and Vanschoren, J. (2016) · 2016
Cited alongside, same era.
DASH: Dynamic approach for switching heuristics
Di Liberto, G., Kadioglu, S., Leo, K., and Malitsky, Y. (2016) · 2016
Cited alongside, same era.
Learning to branch in mixed integer programming
Khalil, E., Le Bodic, P., Song, L., Nemhauser, G., and Dilkina, B. (2016) · 2016
Graph neural networks: A review of methods and applications
Zhou, J., Cui, G., Hu, S., Zhang, Z., Yang, C., Liu, Z., Wang, L., Li, C., and Sun, M. (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.
Janos: An integrated predictive and prescriptive modeling framework
Bergman, D., Huang, T., Brooks, P. A., Lodi, A., and Raghunathan, 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 Velickovic, P. (2021) · 2021
Later among the works it cites.
Optimization problems for machine learning: A survey
Gambella, C., Ghaddar, B., and Naoum-Sawaya, J. (2021) · 2021
Later among the works it cites.
Branch and bound in mixed integer linear programming problems: A survey of techniques and trends
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Learning to optimize
Li, K. and Malik, J. (2016) · 2016
Cited alongside, same era.
The irace package: Iterated racing for automatic algorithm configuration
López-Ibáñez, M., Dubois-Lacoste, J., Cáceres, L. P., Birattari, M., and Stützle, T. (2016) · 2016
Cited alongside, same era.
Scheduling: theory, algorithms, and systems
Pinedo, M. L. (2016) · 2016
Cited alongside, same era.
An overview of gradient descent optimization algorithms
Ruder, S. (2016) · 2016
Cited alongside, same era.
A machine learning-based approximation of strong branching
Alvarez, A. M., Louveaux, Q., and Wehenkel, L. (2017) · 2017
Cited alongside, same era.
OptNet: Differentiable optimization as a layer in neural networks
Amos, B. and Kolter, J. Z. (2017) · 2017
Cited alongside, same era.
Huang, L., Chen, X., Huo, W., Wang, J., Zhang, F., Bai, B., and Shi, L. (2021) · 2021
Later among the works it cites.
Optverse solver
Huawei (2021) · 2021
Later among the works it cites.
Accelerating quadratic optimization with reinforcement learning
Ichnowski, J., Jain, P., Stellato, B., Banjac, G., Luo, M., Borrelli, F., Gonzalez, J. E., Stoica, I., and Goldberg, K. (2021) · 2021
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.
Diving Heuristics
Maniezzo, V., Boschetti, M. A., and Stützle, T. (2021) · 2021
Later among the works it cites.
Mixed-integer optimization with constraint learning
Maragno, D., Wiberg, H. M., Bertsimas, D., Birbil, S. I., den Hertog, D., and Fajemisin, A. O. (2021) · 2021
Later among the works it cites.
A triangulation and fill-reducing initialization procedure for the simplex algorithm
Ploskas, N., Sahinidis, N. V., and Samaras, N. (2021) · 2021
Later among the works it cites.
Smart feasibility pump: Reinforcement learning for (mixed) integer programming
Qi, M., Wang, M., and Shen, Z.-J. (2021) · 2021
Later among the works it cites.
Learning a large neighborhood search algorithm for mixed integer programs
Sonnerat, N., Wang, P., Ktena, I., Bartunov, S., and Nair, V. (2021) · 2021
Later among the works it cites.
A surrogate objective framework for prediction+optimization with soft constraints
Yan, K., Yan, J., Luo, C., Chen, L., Lin, Q., and Zhang, D. (2021) · 2021
Later among the works it cites.
A study of learning search approximation in mixed integer branch and bound: Node selection in SCIP
Yilmaz, K. and Yorke-Smith, N. (2021) · 2021
Later among the works it cites.
Parameterizing branch-and-bound search trees to learn branching policies
Zarpellon, G., Jo, J., Lodi, A., and Bengio, Y. (2021) · 2021
Later among the works it cites.
Automated dynamic algorithm configuration
Adriaensen, S., Biedenkapp, A., Shala, G., Awad, N., Eimer, T., Lindauer, M., and Hutter, F. (2022) · 2022
Later among the works it cites.
The perils of learning before optimizing
Cameron, C., Hartford, J., Lundy, T., and Leyton-Brown, K. (2022) · 2022
Later among the works it cites.
Learning to optimize: A primer and a benchmark
Chen, T., Chen, X., Chen, W., Heaton, H., Liu, J., Wang, Z., and Yin, W. (2022) · 2022
Later among the works it cites.
A deep reinforcement learning framework for column generation
Chi, C., Aboussalah, A. M., Khalil, E. B., Wang, J., and Sherkat-Masoumi, Z. (2022) · 2022
Later among the works it cites.
Smart “predict, then optimize”
Elmachtoub, A. N. and Grigas, P. (2022) · 2022
Later among the works it cites.
Learning for spatial branching: An algorithm selection approach
Ghaddar, B., Gómez-Casares, I., González-Díaz, J., González-Rodríguez, B., Pateiro-López, B., and Rodríguez-Ballesteros, S. (2022) · 2022
Later among the works it cites.
Polynomial optimization: Enhancing RLT relaxations with conic constraints
González-Rodríguez, B., Alvite-Pazó, R., Alvite-Pazó, S., Ghaddar, B., and González-Díaz, J. (2022) · 2022
Later among the works it cites.
Lookback for learning to branch
Gupta, P., Khalil, E. B., Chetélat, D., Gasse, M., Bengio, Y., Lodi, A., and Kumar, M. P. (2022) · 2022
Later among the works it cites.
Gurobi Optimizer Reference Manual
Gurobi (2022) · 2022
Later among the works it cites.
Learning to select cuts for efficient mixed-integer programming
Huang, Z., Wang, K., Liu, F., Zhen, H.-L., Zhang, W., Yuan, M., Hao, J., Yu, Y., and Wang, J. (2022) · 2022
Later among the works it cites.
Learning context-aware adaptive solvers to accelerate quadratic programming
Jung, H., Park, J., and Park, J. (2022) · 2022
Later among the works it cites.
Learning to compare nodes in branch and bound with graph neural networks
Labassi, A. G., Chételat, D., and Lodi, A. (2022) · 2022
Later among the works it cites.
Rethinking optimal pivoting paths of simplex method
Li, A., Li, B., Han, C., and Guo, T. (2022) · 2022
Later among the works it cites.
SMAC3: A versatile bayesian optimization package for hyperparameter optimization
Lindauer, M., Eggensperger, K., Feurer, M., Biedenkapp, A., Deng, D., Benjamins, C., Ruhkopf, T., Sass, R., and Hutter, F. (2022) · 2022
Later among the works it cites.
Training language models to follow instructions with human feedback
Ouyang, L., Wu, J., Jiang, X., Almeida, D., Wainwright, C. L., Mishkin, P., Zhang, C., Agarwal, S., Slama, K., Ray, A., Schulman, J., Hilton, J., Kelton, F., Miller, L., Simens, M., Askell, A., Welinder, P., Christiano, P., Leike, J., and Lowe, R. (2022) · 2022
Later among the works it cites.
Learning to cut by looking ahead: Cutting plane selection via imitation learning
Paulus, M. B., Zarpellon, G., Krause, A., Charlin, L., and Maddison, C. (2022) · 2022
Later among the works it cites.
An improved reinforcement learning algorithm for learning to branch
Qu, Q., Li, X., Zhou, Y., Zeng, J., Yuan, M., Wang, J., Lv, J., Liu, K., and Mao, K. (2022) · 2022
Later among the works it cites.
Learning to model editing processes
Reid, M. and Neubig, G. (2022) · 2022
Later among the works it cites.
A survey of methods for automated algorithm configuration
Schede, E., Brandt, J., Tornede, A., Wever, M., Bengs, V., Hullermeier, E., and Tierney, K. (2022) · 2022
Later among the works it cites.
Enhancing column generation by a machine-learning-based pricing heuristic for graph coloring
Shen, Y., Sun, Y., Li, X., Eberhard, A., and Ernst, A. (2022) · 2022
Later among the works it cites.
Reinforcement learning of simplex pivot rules: a proof of concept
Suriyanarayana, V., Tavaslıoğlu, O., Patel, A. B., and Schaefer, A. J. (2022) · 2022
Later among the works it cites.
A reinforcement learning approach to parameter selection for distributed optimal power flow
Zeng, S., Kody, A., Kim, Y., Kim, K., and Molzahn, D. K. (2022) · 2022
Later among the works it cites.
A survey for solving mixed integer programming via machine learning
Zhang, J., Liu, C., Yan, J., Li, X., Zhen, H.-L., and jie Yuan, M. (2022) · 2022
Later among the works it cites.
Symbolic learning to optimize: Towards interpretability and scalability
Zheng, W., Chen, T., Hu, T.-K., and Wang, Z. (2022) · 2022
Later among the works it cites.
Sparks of artificial general intelligence: Early experiments with GPT-4
Bubeck, S., Chandrasekaran, V., Eldan, R., Gehrke, J., Horvitz, E., Kamar, E., Lee, P., Lee, Y. T., Li, Y., Lundberg, S., Nori, H., Palangi, H., Ribeiro, M. T., and Zhang, Y. (2023) · 2023
Later among the works it cites.
Explainable ai for operational research: A defining framework, methods, applications, and a research agenda
De Bock, K. W., Coussement, K., Caigny, A. D., Słowiński, R., Baesens, B., Boute, R. N., Choi, T.-M., Delen, D., Kraus, M., Lessmann, S., Maldonado, S., Martens, D., Óskarsdóttir, M., Vairetti, C., Verbeke, W., and Weber, R. (2023) · 2023
Later among the works it cites.
Optimization with constraint learning: A framework and survey
Fajemisin, A. O., Maragno, D., and den Hertog, D. (2023) · 2023
Later among the works it cites.
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
Later among the works it cites.
Reference matters: Benchmarking factual error correction for dialogue summarization with fine-grained evaluation framework
Gao, M., Wan, X., Su, J., Wang, Z., and Huai, B. (2023) · 2023
Later among the works it cites.
NL4Opt competition: Formulating optimization problems based on their natural language descriptions
Ramamonjison, R., Yu, T. T., Li, R., Li, H., Carenini, G., Ghaddar, B., He, S., Mostajabdaveh, M., Banitalebi-Dehkordi, A., Zhou, Z., and Zhang, Y. (2023) · 2023
Later among the works it cites.
Code llama: Open foundation models for code
Rozière, B., Gehring, J., Gloeckle, F., Sootla, S., Gat, I., Tan, X. E., Adi, Y., Liu, J., Remez, T., Rapin, J., Kozhevnikov, A., Evtimov, I., Bitton, J., Bhatt, M., Ferrer, C. C., Grattafiori, A., Xiong, W., Défossez, A., Copet, J., Azhar, F., Touvron, H., Martin, L., Usunier, N., Scialom, T., and Synnaeve, G. (2023) · 2023
Later among the works it cites.
Stanford Alpaca: An instruction-following LLaMA model
Taori, R., Gulrajani, I., Zhang, T., Dubois, Y., Li, X., Guestrin, C., Liang, P., and Hashimoto, T. B. (2023) · 2023
Later among the works it cites.
Llama 2: Open foundation and fine-tuned chat models
Touvron, H., Martin, L., Stone, K., Albert, P., Almahairi, A., Babaei, Y., Bashlykov, N., Batra, S., Bhargava, P., Bhosale, S., Bikel, D., Blecher, L., Ferrer, C. C., Chen, M., Cucurull, G., Esiobu, D., Fernandes, J., Fu, J., Fu, W., Fuller, B., Gao, C., Goswami, V., Goyal, N., Hartshorn, A., Hosseini, S., Hou, R., Inan, H., Kardas, M., Kerkez, V., Khabsa, M., Kloumann, I., Korenev, A., Koura, P. S., Lachaux, M.-A., Lavril, T., Lee, J., Liskovich, D., Lu, Y., Mao, Y., Martinet, X., Mihaylov, T., Mishra, P., Molybog, I., Nie, Y., Poulton, A., Reizenstein, J., Rungta, R., Saladi, K., Schelten, A., Silva, R., Smith, E. M., Subramanian, R., Tan, X. E., Tang, B., Taylor, R., Williams, A., Kuan, J. X., Xu, P., Yan, Z., Zarov, I., Zhang, Y., Fan, A., Kambadur, M., Narang, S., Rodriguez, A., Stojnic, R., Edunov, S., and Scialom, T. (2023) · 2023
Later among the works it cites.
Everything is connected: Graph neural networks
Veličković, P. (2023) · 2023
Later among the works it cites.
A review on learning to solve combinatorial optimisation problems in manufacturing
Zhang, C., Wu, Y., Ma, Y., Song, W., Le, Z., Cao, Z., and Zhang, J. (2023) · 2023
Later among the works it cites.
Lima: Less is more for alignment
Zhou, C., Liu, P., Xu, P., Iyer, S., Sun, J., Mao, Y., Ma, X., Efrat, A., Yu, P., Yu, L., Zhang, S., Ghosh, G., Lewis, M., Zettlemoyer, L., and Levy, O. (2023) · 2023
Later among the works it cites.
Adaptive admm for distributed ac optimal power flow
Mhanna, S., Verbič, G., and Chapman, A. C. (2018) · 2035
Closest in time.