Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  considers a recently introduced NP-hard problem on graphs, called the dominating tree problem. In order to solve this problem,  develop a variable neighborhood search (VNS) based heuristic. Feasible solutions are obtained by using the set of vertex permutations that allow us to implement standard neighborhood structures and the appropriate local search procedure. Computational experiments include two classes of randomly generated test instances and benchmark test instances from the literature. Optimality of VNS solutions on small size instances is verified with CPLEX.
['Zorica Dražić', 'Mirjana Čangalović', 'Vera Kovačević-Vujčić']
I am writing a research paper on a idea A metaheuristic approach to the dominating tree problem
[{"from": "human", "value": "I am writing a research paper on a idea A metaheuristic approach to the dominating tree problem"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  considers a recently introduced NP-hard problem on graphs, called the dominating tree problem. In order to solve this problem,  develop a variable neighborhood search (VNS) based heuristic. Feasible solutions are obtained by using the set of vertex permutations that allow us to implement standard neighborhood structures and the appropriate local search procedure. Computational experiments include two classes of randomly generated test instances and benchmark test instances from the literature. Optimality of VNS solutions on small size instances is verified with CPLEX."}]