NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
From MaRDI portal
Recommendations
- A rapid learning automata-based approach for generalized minimum spanning tree problem
- Learning the travelling salesperson problem requires rethinking generalization
- Learn to solve dominating set problem with GNN and reinforcement learning
- General variable neighborhood search for the minimum stretch spanning tree problem
- Solving large-scale routing optimization problems with networks and only networks
Cites work
- A branch and cut algorithm for the Steiner problem in graphs
- A branch and cut method for the degree-constrained minimum spanning tree problem
- A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
- A fast algorithm for computing minimum routing cost spanning trees
- A hybrid GRASP with perturbations for the Steiner problem in graphs
- A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
- An improved LP-based approximation for Steiner tree
- Approximating minimum bounded degree spanning trees to within one of optimal
- Approximating the Minimum-Degree Steiner Tree to within One of Optimal
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
- Combined column-and-row-generation for the optimal communication spanning tree problem
- Computational Science - ICCS 2004
- Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm
- Efficient path and vertex exchange in steiner tree algorithms
- Exact algorithms for minimum routing cost trees
- Fast local search for the Steiner problem in graphs
- High generalization performance structured self-attention model for knapsack problem
- scientific article; zbMATH DE number 3677874 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1538542 (Why is no real title available?)
- Improved algorithms for the Steiner problem in networks
- Lower and upper bounds for the degree-constrained minimum spanning tree problem
- Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine
- New valid inequalities for the optimal communication spanning tree problem
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Reactive tabu search with path-relinking for the Steiner problem in graphs
- Reducibility among combinatorial problems
- Solving Combinatorial Problems with Machine Learning Methods
- Solving Steiner tree problems in graphs to optimality
- Solving the Graphical Steiner Tree Problem Using Genetic Algorithms
- Solving the optimum communication spanning tree problem
- The complexity of the network design problem
- The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm
- The PACE 2018 parameterized algorithms and computational experiments challenge: the third iteration
- The salesman and the tree: the importance of search in CP
- The Steiner tree problem on graphs: inapproximability results
- Using Lagrangian dual information to generate degree constrained spanning trees
- Worst-Case Analysis of Network Design Problem Heuristics
- Über ein Minimalproblem.
Cited in
(3)
This page was built for publication: NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564769)
