Fetching the paper…
Reading the bibliography…
In many operational applications, it is necessary to routinely find, within a very limited time window, provably good solutions to challenging mixed-integer linear programming (MILP) problems.
An automatic method for solving discrete programming problems
A. H. Land and A. G. Doig · 1960
Earlier work this paper cites.
Power generation scheduling by integer programming-development of theory
Len L Garver · 1962
Earlier work this paper cites.
Trivial integer programs unsolvable by branch-and-bound
Robert G Jeroslow · 1974
Earlier work this paper cites.
Hard knapsack problems
Vasek Chvátal · 1980
Earlier work this paper cites.
Optimization-based methods for operations scheduling
Arthur I Cohen and Vahid R Sherkat · 1987
Earlier work this paper cites.
On the complexity of branch and cut methods for the traveling salesman problem
William J Cook and Mark Hartmann · 1990
Earlier work this paper cites.
Finding cuts in the tsp (a preliminary report)
David Applegate, Robert Bixby, Vašek Chvátal, and William Cook · 1995
Earlier work this paper cites.
A computational study of search strategies for mixed integer programming
Jeff T Linderoth and Martin WP Savelsbergh · 1999
Earlier work this paper cites.
Integer and combinatorial optimization
Laurence A Wolsey and George L Nemhauser · 1999
Earlier work this paper cites.
Branching rules revisited
Tobias Achterberg, Thorsten Koch, and Alexander Martin · 2005
Earlier work this paper cites.
Extremely randomized trees
Pierre Geurts, Damien Ernst, and Louis Wehenkel · 2006
Earlier work this paper cites.
Constraint Integer Programming
Tobias Achterberg · 2007
Earlier work this paper cites.
A quantitative analysis of the relationship between congestion and reliability in electric power networks
Seth Blumsack, Lester B Lave, and Marija Ilic · 2007
Earlier work this paper cites.
Optimal transmission switching
Emily B Fisher, Richard P O’Neill, and Michael C Ferris · 2008
Earlier work this paper cites.
The elements of statistical learning: data mining, inference, and prediction
Trevor Hastie, Robert Tibshirani, Jerome H Friedman, and Jerome H Friedman · 2009
Earlier work this paper cites.
Mixed integer programming computation
Andrea Lodi · 2010
Earlier work this paper cites.
Matpower: Steady-state operations, planning, and analysis tools for power systems research and education
Ray Daniel Zimmerman, Carlos Edmundo Murillo-Sánchez, and Robert John Thomas · 2010
Earlier work this paper cites.
Tight mixed integer linear programming formulations for the unit commitment problem
James Ostrowski, Miguel F Anjos, and Anthony Vannelli · 2011
Cited alongside, same era.
Contingency ranking with respect to overloads in very large power systems taking into account uncertainty, preventive, and corrective actions
Stéphane Fliscounakis, Patrick Panciatici, Florin Capitanescu, and Louis Wehenkel · 2013
Cited alongside, same era.
Tight and compact milp formulation for the thermal unit commitment problem
Germán Morales-España, Jesus M Latorre, and Andres Ramos · 2013
Cited alongside, same era.
A supervised machine learning approach to variable branching in branch-and-bound
Alejandro Marcos Alvarez, Quentin Louveaux, and Louis Wehenkel · 2014
Cited alongside, same era.
Integer programming
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli, et al · 2014
Cited alongside, same era.
Hybrid models for learning to branch
Prateek Gupta, Maxime Gasse, Elias B Khalil, M Pawan Kumar, Andrea Lodi, and Yoshua Bengio · 2020
Later among the works it cites.
A k-nearest neighbor heuristic for real-time dc optimal transmission switching
Emma S Johnson, Shabbir Ahmed, Santanu S Dey, and Jean-Paul Watson · 2020
Later among the works it cites.
Solving mixed integer programs using neural networks
Vinod Nair, Sergey Bartunov, Felix Gimeno, Ingrid von Glehn, Pawel Lichocki, Ivan Lobov, Brendan O’Donoghue, Nicolas Sonnerat, Christian Tjandraatmadja, Pengming Wang, et al · 2020
Later among the works it cites.
Applying deep learning to the newsvendor problem
Afshin Oroojlooyjadid, Lawrence V Snyder, and Martin Takáč · 2020
Later among the works it cites.
Ecole: A gym-like library for machine learning in combinatorial optimization solvers
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Alejandro Marcos Alvarez, Louis Wehenkel, and Quentin Louveaux · 2016
Cited alongside, same era.
Improving large scale day-ahead security constrained unit commitment performance
Yonghong Chen, Aaron Casto, Fengyu Wang, Qianfan Wang, Xing Wang, and Jie Wan · 2016
Cited alongside, same era.
Ac power flow data in matpower and qcqp format: itesla, rte snapshots, and pegase
Cédric Josz, Stéphane Fliscounakis, Jean Maeght, and Patrick Panciatici · 2016
Cited alongside, same era.
Learning to branch in mixed integer programming
Elias Khalil, Pierre Le Bodic, Le Song, George Nemhauser, and Bistra Dilkina · 2016
Cited alongside, same era.
A cycle-based formulation and valid inequalities for dc power transmission problems with switching
Burak Kocuk, Hyemin Jeon, Santanu S Dey, Jeff Linderoth, James Luedtke, and Xu Andy Sun · 2016
Cited alongside, same era.
A machine learning-based approximation of strong branching
Alejandro Marcos Alvarez, Quentin Louveaux, and Louis Wehenkel · 2017
Cited alongside, same era.
On learning and branching: a survey
Andrea Lodi and Giulia Zarpellon · 2017
Cited alongside, same era.
Antoine Prouvost, Justin Dumouchelle, Lara Scavuzzo, Maxime Gasse, Didier Chételat, and Andrea Lodi · 2020
Later among the works it cites.
MIPLearn: An Extensible Framework for Learning-Enhanced Optimization, 2020
Alinson Santos Xavier and Feng Qiu · 2020
Later among the works it cites.
UnitCommitment.jl: A Julia/JuMP Optimization Package for Security-Constrained Unit Commitment, 2020
Alinson Santos Xavier and Feng Qiu · 2020
Later among the works it cites.
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
Yu Yang, Natashia Boland, Bistra Dilkina, and Martin Savelsbergh · 2020
Later among the works it cites.
Complexity of branch-and-bound and cutting planes in mixed-integer optimization-ii
Amitabh Basu, Michele Conforti, Marco Di Summa, and Hongyi Jiang · 2021
Later among the works it cites.
A theoretical and computational analysis of full strong-branching
Santanu S Dey, Yatharth Dubey, Marco Molinaro, and Prachi Shah · 2021
Later among the works it cites.
Lower bound on size of branch-and-bound trees for solving lot-sizing problem
Santanu S Dey and Prachi Shah · 2021
Later among the works it cites.
Learning to solve large-scale security-constrained unit commitment problems
Álinson S Xavier, Feng Qiu, and Shabbir Ahmed · 2021
Later among the works it cites.
Lower bounds on the size of general branch-and-bound trees
Santanu S Dey, Yatharth Dubey, and Marco Molinaro · 2022
Closest in time.
Gurobi Optimizer Reference Manual, 2022
Gurobi Optimization, LLC · 2022
Closest in time.
Predicting tactical solutions to operational planning problems under imperfect information
Eric Larsen, Sébastien Lachapelle, Yoshua Bengio, Emma Frejinger, Simon Lacoste-Julien, and Andrea Lodi · 2022
Closest in time.
Deep reinforcement learning for exact combinatorial optimization: Learning to branch
Tianyu Zhang, Amin Banitalebi-Dehkordi, and Yong Zhang · 2022
Closest in time.