Fetching the paper…
Reading the bibliography…
Branch-and-bound approaches in integer programming require ordering portions of the space to explore next, a problem known as node comparison.
A tree-search algorithm for mixed integer programming problems
Robert J. Dakin · 1965
Earlier work this paper cites.
A formal basis for the heuristic determination of minimum cost paths
Peter E. Hart, Nils J. Nilsson, and Bertram Raphael · 1968
Earlier work this paper cites.
Experiments in mixed-integer linear programming
Michel Bénichou, Jean-Michel Gauthier, Paul Girodet, Gerard Hentges, Gerard Ribière, and Olivier Vincent · 1971
Earlier work this paper cites.
Practical solution of large mixed integer programming problems with UMPIRE
J.J.H. Forrest, J.P.H. Hirst, and J.A. Tomlin · 1974
Earlier work this paper cites.
Efficient training of artificial neural networks for autonomous navigation
Dean A. Pomerleau · 1991
Earlier work this paper cites.
Signature verification using a “siamese” time delay neural network
Jane Bromley, Isabelle Guyon, Yann LeCun, Eduard Säckinger, and Roopak Shah · 1993
Earlier work this paper cites.
The Nature of Statistical Learning Theory
Vladimir Vapnik · 1999
Earlier work this paper cites.
Learning to rank using gradient descent
Chris Burges, Tal Shaked, Erin Renshaw, Ari Lazier, Matt Deeds, Nicole Hamilton, and Greg Hullender · 2005
Earlier work this paper cites.
Mixed integer linear programming in process scheduling: Modeling, algorithms, and applications
Christodoulos A. Floudas and Xiaoxia Lin · 2005
Earlier work this paper cites.
A new model for learning in graph domains
Marco Gori, Gabriele Monfardini, and Franco Scarselli · 2005
Earlier work this paper cites.
Combinatorial auctions
Jawad Abrache, Teodor Gabriel Crainic, Michel Gendreau, and Monia Rekik · 2007
Earlier work this paper cites.
Constraint Integer Programming
Tobias Achterberg · 2007
Earlier work this paper cites.
Constraint integer programming: Techniques and applications
Tobias Achterberg, Timo Berthold, Stefan Heinz, Thorsten Koch, and Kati Wolter · 2008
Cited alongside, same era.
Generating hard instances for MaxSAT
Ramón Béjar, Alba Cabiscol, Felip Manyà, and Jordi Planes · 2009
Cited alongside, same era.
Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
Mike Hewitt, George Nemhauser, and Martin Savelsbergh · 2010
Cited alongside, same era.
An automatic method for solving discrete programming problems
Ailsa H. Land and Alison G. Doig · 2010
Cited alongside, same era.
Efficient reductions for imitation learning
Stéphane Ross and Drew Bagnell · 2010
Cited alongside, same era.
Scikit-learn: Machine learning in Python
Fabian Pedregosa, Gaël Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel, Peter Prettenhofer, Ron Weiss, Vincent Dubourg, Jake Vanderplas, Alexandre Passos, David Cournapeau, Matthieu Brucher, Matthieu Perrot, and Édouard Duchesnay · 2011
Learning to search via retrospective imitation
Jialin Song, Ravi Lanka, Albert Zhao, Aadyot Bhatnagar, Yisong Yue, and Masahiro Ono · 2018
Later among the works it cites.
Exact combinatorial optimization with graph convolutional neural networks
Maxime Gasse, Didier Chételat, Nicola Ferroni, Laurent Charlin, and Andrea Lodi · 2019
Later among the works it cites.
Pytorch: An imperative style, high-performance deep learning library
Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala · 2019
Later among the works it cites.
Reinforcement learning for variable selection in a branch and bound algorithm
Marc Etheve, Zacharie Alès, Côme Bissuel, Olivier Juan, and Safia Kedad-Sidhoum · 2020
Later among the works it cites.
The SCIP Optimization Suite 7.0
Gerald Gamrath, Daniel Anderson, Ksenia Bestuzheva, Wei-Kun Chen, Leon Eifler, Maxime Gasse, Patrick Gemander, Ambros Gleixner, Leona Gottwald, Katrin Halbig, Gregor Hendel, Christopher Hojny, Thorsten Koch, Pierre Le Bodic, Stephen J. Maher, Frederic Matter, Matthias Miltenberger, Erik Mühmer, Benjamin Müller, Marc E. Pfetsch, Franziska Schlösser, Felipe Serrano, Yuji Shinano, Christine Tawfik, Stefan Vigerske, Fabian Wegscheider, Dieter Weninger, and Jakob Witzig · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A reduction of imitation learning and structured prediction to no-regret online learning
Stéphane Ross, Geoffrey Gordon, and Drew Bagnell · 2011
Cited alongside, same era.
Learning to search in branch-and-bound algorithms
He He, Hal Daume III, and Jason M. Eisner · 2014
Cited alongside, same era.
Adam: A method for stochastic optimization
Diederik P. Kingma and Jimmy Ba · 2014
Cited alongside, same era.
A simulation scenario based mixed integer programming approach to airline reserve crew scheduling under uncertainty
Christopher Bayliss, Geert De Maere, Jason A.D. Atkin, and Marc Paelinck · 2017
Cited alongside, same era.
The generalized independent set problem: Polyhedral analysis and solution approaches
Marco Colombi, Renata Mansini, and Martin Savelsbergh · 2017
Cited alongside, same era.
Empirical decision model learning
Michele Lombardi, Michela Milano, and Andrea Bartolini · 2017
Cited alongside, same era.
Later among the works it cites.
Hybrid models for learning to branch
Prateek Gupta, Maxime Gasse, Elias Khalil, Pawan Mudigonda, Andrea Lodi, and Yoshua Bengio · 2020
Later among the works it cites.
Gurobi Optimizer Reference Manual
Gurobi Optimization LLC · 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.
Machine learning for combinatorial optimization: A methodological tour d’horizon
Yoshua Bengio, Andrea Lodi, and Antoine Prouvost · 2021
Later among the works it cites.
Learning to schedule heuristics in branch and bound
Antonia Chmiela, Elias Khalil, Ambros Gleixner, Andrea Lodi, and Sebastian Pokutta · 2021
Later among the works it cites.
A study of learning search approximation in mixed integer branch and bound: Node selection in SCIP
Kaan Yilmaz and Neil Yorke-Smith · 2021
Later among the works it cites.
Parameterizing branch-and-bound search trees to learn branching policies
Giulia Zarpellon, Jason Jo, Andrea Lodi, and Yoshua Bengio · 2021
Later among the works it cites.