Fetching the paper…
Reading the bibliography…
This paper studies a strategy for data-driven algorithm design for large-scale combinatorial optimization problems that can leverage existing state-of-the-art solvers in general purpose ways.
On the evolution of random graphs
P. Erdős and A. Rényi · 1960
Earlier work this paper cites.
Toward automatic program synthesis
Z. Manna and R. J. Waldinger · 1971
Earlier work this paper cites.
A local-ratio theorm for approximating the weighted vertex cover problem
R. Bar-Yehuda and S. Even · 1983
Earlier work this paper cites.
Alvinn: An autonomous land vehicle in a neural network
D. A. Pomerleau · 1989
Earlier work this paper cites.
Handbook of combinatorial optimization , volume 4
D. Du and P. M. Pardalos · 1998
Earlier work this paper cites.
Using constraint programming and local search methods to solve vehicle routing problems
P. Shaw · 1998
Earlier work this paper cites.
Towards a universal test suite for combinatorial auction algorithms
K. Leyton-Brown, M. Pearson, and Y. Shoham · 2000
Earlier work this paper cites.
Policy gradient methods for reinforcement learning with function approximation
R. S. Sutton, D. A. McAllester, S. P. Singh, and Y. Mansour · 2000
Earlier work this paper cites.
A survey of very large-scale neighborhood search techniques
R. K. Ahuja, Ö. Ergun, J. B. Orlin, and A. P. Punnen · 2002
Earlier work this paper cites.
Statistical mechanics of complex networks
R. Albert and A.-L. Barabási · 2002
Earlier work this paper cites.
Rank-two relaxation heuristics for max-cut and other binary quadratic programs
S. Burer, R. D. Monteiro, and Y. Zhang · 2002
Earlier work this paper cites.
The quest for efficient boolean satisfiability solvers
L. Zhang and S. Malik · 2002
Earlier work this paper cites.
Combinatorial auctions: A survey
S. De Vries and R. V. Vohra · 2003
Earlier work this paper cites.
Map estimation via agreement on trees: message-passing and linear programming
M. Wainwright, T. Jaakkola, and A. Willsky · 2005
Earlier work this paper cites.
Primal heuristics for mixed integer programs
T. Berthold · 2006
Earlier work this paper cites.
Combinatorial search of thermoelastic shape-memory alloys with extremely small hysteresis width
J. Cui, Y. S. Chu, O. O. Famodu, Y. Furuya, J. Hattrick-Simpers, R. D. James, A. Ludwig, S. Thienhaus, M. Wuttig, Z. Zhang, et al · 2006
Earlier work this paper cites.
Ant colony optimization
M. Dorigo, M. Birattari, and T. Stutzle · 2006
Cited alongside, same era.
An evolutionary algorithm for polishing mixed integer programming solutions
E. Rothberg · 2007
Cited alongside, same era.
Z3: An efficient smt solver
L. De Moura and N. Bjørner · 2008
Cited alongside, same era.
An efficient motion planning algorithm for stochastic dynamic systems with constraints on probability of failure
M. Ono and B. C. Williams · 2008
Cited alongside, same era.
Scip: solving constraint integer programs
T. Achterberg · 2009
Cited alongside, same era.
Heuristics in mixed integer programming
M. Fischetti and A. Lodi · 2010
Cited alongside, same era.
Model-based genetic algorithms for algorithm configuration
C. Ansótegui, Y. Malitsky, H. Samulowitz, M. Sellmann, and K. Tierney · 2015
Later among the works it cites.
Learning to branch in mixed integer programming
E. B. Khalil, P. Le Bodic, L. Song, G. Nemhauser, and B. Dilkina · 2016
Later among the works it cites.
Device placement optimization with reinforcement learning
A. Mirhoseini, H. Pham, Q. V. Le, B. Steiner, R. Larsen, Y. Zhou, N. Kumar, M. Norouzi, S. Bengio, and J. Dean · 2017
Later among the works it cites.
Latest benchmarks of optimization software
H. D. Mittelmann · 2017
Later among the works it cites.
Learning to branch
M.-F. Balcan, T. Dick, T. Sandholm, and E. Vitercik · 2018
Later among the works it cites.
Adaptive large neighborhood search for mixed integer programming
G. Hendel · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Helber and F. Sahling · 2010
Cited alongside, same era.
An automatic method for solving discrete programming problems
A. H. Land and A. G. Doig · 2010
Cited alongside, same era.
Large neighborhood search
D. Pisinger and S. Ropke · 2010
Cited alongside, same era.
Efficient reductions for imitation learning
S. Ross and D. Bagnell · 2010
Cited alongside, same era.
Automated algorithm configuration and parameter tuning
H. H. Hoos · 2011
Cited alongside, same era.
Sequential model-based optimization for general algorithm configuration
F. Hutter, H. H. Hoos, and K. Leyton-Brown · 2011
Cited alongside, same era.
Semi-amortized variational autoencoders
Y. Kim, S. Wiseman, A. C. Miller, D. Sontag, and A. M. Rush · 2018
Later among the works it cites.
Learning to search via retrospective imitation
J. Song, R. Lanka, A. Zhao, Y. Yue, and M. Ono · 2018
Later among the works it cites.
Exact combinatorial optimization with graph convolutional neural networks
M. Gasse, D. Chételat, N. Ferroni, L. Charlin, and A. Lodi · 2019
Later among the works it cites.
Neural large neighborhood search for the capacitated vehicle routing problem
A. Hottung and K. Tierney · 2019
Later among the works it cites.
Procrastinating with confidence: Near-optimal, anytime, adaptive algorithm configuration
R. Kleinberg, K. Leyton-Brown, B. Lucier, and D. Graham · 2019
Later among the works it cites.
Gurobi 8 performance benchmarks, 2019
G. Optimization · 2019
Later among the works it cites.
Co-training for policy learning
J. Song, R. Lanka, Y. Yue, and M. Ono · 2019
Later among the works it cites.
Neural network based large neighborhood search algorithm for ride hailing services
A. A. Syed, K. Akhnoukh, B. Kaltenhaeuser, and K. Bogenberger · 2019
Later among the works it cites.
Learning to plan via neural exploration-exploitation trees
B. Chen, B. Dai, and L. Song · 2020
Closest in time.