Learn to solve dominating set problem with GNN and reinforcement learning
From MaRDI portal
Recommendations
- A differentiable approach to the maximum independent set problem using dataless neural networks
- NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
- Learning the travelling salesperson problem requires rethinking generalization
- Solving the traveling salesperson problem with precedence constraints by deep reinforcement learning
- scientific article; zbMATH DE number 4201664
Cites work
- ``Neural computation of decisions in optimization problems
- An upper bound for thek-domination number of a graph
- Computing the domination number of grid graphs
- Graph theory with applications
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- Learning heuristics for the TSP by policy gradient
- Models of domination in graphs
- Paradigms of combinatorial optimization. Problems and new approaches
- Statistical mechanics of complex networks
- The domination number of grids
Cited in
(3)
This page was built for publication: Learn to solve dominating set problem with GNN and reinforcement learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6585558)