相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Machine learning for combinatorial optimization: A methodological tour d'horizon
Yoshua Bengio et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)
A Deep Learning Algorithm for the Max-Cut Problem Based on Pointer Network Structure with Supervised Learning and Reinforcement Learning Strategies
Shenshen Gu et al.
MATHEMATICS (2020)
A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
Rene van Bevern et al.
HISTORIA MATHEMATICA (2020)
Mastering Atari, Go, chess and shogi by planning with a learned model
Julian Schrittwieser et al.
NATURE (2020)
Learning Combinatorial Optimization on Graphs: A Survey With Applications to Networking
Natalia Vesselinova et al.
IEEE ACCESS (2020)
Annealing by simulating the coherent Ising machine
Egor S. Tiunov et al.
OPTICS EXPRESS (2019)
Destabilization of Local Minima in Analog Spin Systems by Correction of Amplitude Heterogeneity
Timothee Leleu et al.
PHYSICAL REVIEW LETTERS (2019)
Exact algorithms for maximum independent set
Mingyu Xiao et al.
INFORMATION AND COMPUTATION (2017)
Coherent Ising machines-optical neural networks operating at the quantum limit
Yoshihisa Yamamoto et al.
NPJ QUANTUM INFORMATION (2017)
Mastering the game of Go with deep neural networks and tree search
David Silver et al.
NATURE (2016)
Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover
Takuya Akiba et al.
THEORETICAL COMPUTER SCIENCE (2016)
Human-level control through deep reinforcement learning
Volodymyr Mnih et al.
NATURE (2015)
A Survey of Monte Carlo Tree Search Methods
Cameron B. Browne et al.
IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES (2012)
Finding low-energy conformations of lattice protein models by quantum annealing
Alejandro Perdomo-Ortiz et al.
SCIENTIFIC REPORTS (2012)
Three-dimensional bin packing problem with variable bin height
Yong Wu et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2010)
A Better Approximation Ratio for the Vertex Cover Problem
George Karakostas
ACM TRANSACTIONS ON ALGORITHMS (2009)
Dynamic local search for the maximum clique problem
W Pullan et al.
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH (2006)
An effective local search for the maximum clique problem
K Katayama et al.
INFORMATION PROCESSING LETTERS (2005)
On the hardness of approximating minimum vertex cover
I Dinur et al.
ANNALS OF MATHEMATICS (2005)
Variable neighborhood search for the maximum clique
P Hansen et al.
DISCRETE APPLIED MATHEMATICS (2004)
Heuristic algorithms for the three-dimensional bin packing problem
A Lodi et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2002)
An effective implementation of the Lin-Kernighan traveling salesman heuristic
K Helsgaun
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2000)
Graph-theoretic techniques for macromolecular docking
EJ Gardiner et al.
JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES (2000)
分享论文
