Maximum weighted induced forests and trees: new formulations and a computational comparative review-Reference-Cited by-同舟云学术

Maximum weighted induced forests and trees: new formulations and a computational comparative review

Published:2021-10-31 Issue:4 Volume:29 Page:2263-2287
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Int Trans Operational Res

Author:

Melo Rafael A.¹,Ribeiro Celso C.²

Affiliation:

1. Institute of Computing Universidade Federal da Bahia Salvador BA 40170‐115 Brazil

2. Institute of Computing Universidade Federal Fluminense Niterói RJ 24210‐346 Brazil

Funder

Fundação de Amparo à Pesquisa do Estado da Bahia

Conselho Nacional de Desenvolvimento Científico e Tecnológico

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior

Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1111/itor.13066

Reference50 articles.

1. The k-regular induced subgraph problem

2. The Maximum Weight Connected Subgraph Problem

3. A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem

4. Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference

5. Decycling graphs

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

1. Obtaining the Grundy chromatic number: How bad can my greedy heuristic coloring be?;Computers & Operations Research;2024-08

2. A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem;Annals of Operations Research;2023-09-28

3. MIP formulations for induced graph optimization problems: a tutorial;International Transactions in Operational Research;2023-04-17

4. Integer programming formulations for the k‐in‐a‐tree problem in graphs;International Transactions in Operational Research;2023-04-14

5. New formulations and branch-and-cut procedures for the longest induced path problem;Computers & Operations Research;2022-03