Exact and heuristic algorithms for the weighted total domination problem-Reference-Cited by-同舟云学术

Exact and heuristic algorithms for the weighted total domination problem

Published:2021-03 Issue: Volume:127 Page:105157
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Álvarez-Miranda Eduardo,Sinnl Markus

Funder

Comisión Nacional de Investigación Científica y Tecnológica

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference39 articles.

1. Different formulations for solving the heaviest k-subgraph problem;Billionnet;INFOR: Inf. Syst. Oper. Res.,2005

2. A polyhedral study of the maximum edge subgraph problem;Bonomo;Discr. Appl. Math.,2012

3. Towards a theory of domination in graphs;Cockayne;Networks,1977

4. Total domination in graphs;Cockayne;Networks,1980

5. CPLEX manual. Branch & cut or dynamic search?, a. https://www.ibm.com/support/knowledgecenter/SSSA5P_12.9.0/ilog.odms.cplex.help/CPLEX/UsrMan/topics/discr_optim/mip/performance/13_br_cut_dyn_srch.html.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A knowledge-based iterated local search for the weighted total domination problem;Information Sciences;2024-04

2. Exact and heuristic algorithms for the domination problem;European Journal of Operational Research;2024-03

3. Improving Biased Random Key Genetic Algorithm with Variable Neighborhood Search for the Weighted Total Domination Problem;Lecture Notes in Computer Science;2024

4. Variable neighborhood search for weighted total domination problem and its application in social network information spreading;Applied Soft Computing;2023-08