Learning to sample initial solution for solving 0-1 discrete optimization problem by local search

Artificial neural networks and deep learning (68T07) Integer programming (90C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Optimization by Simulated Annealing
A new exact maximum clique algorithm for large and massive sparse graphs
Heuristics for the general multiple non-linear knapsack problem
Discovering dispatching rules using data mining
Dynamic programming algorithms for the zero-one knapsack problem
A framework for the greedy algorithm
Where are the hard knapsack problems?
Future paths for integer programming and links to artificial intelligence
Learning when to use a decomposition
Machine learning for combinatorial optimization: a methodological tour d'horizon
Exact and heuristic methods in combinatorial optimization. A study on the linear ordering and the maximum diversity problem
Knapsack problems -- an overview of recent advances. I: Single knapsack problems
Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
Deep learning assisted heuristic tree search for the container pre-marshalling problem
Problems of discrete optimization: challenges and main approaches to solve them
On learning and branching: a survey
A review on algorithms for maximum clique problems
Dynamic programming and optimal control. Vol. 2
An Automatic Method of Solving Discrete Programming Problems
Parallel Maximum Clique Algorithms with Applications to Network Analysis
Algorithm 457: finding all cliques of an undirected graph
Combinatorial optimization. Theory and algorithms