A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem-Reference-Cited by-同舟云学术

A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem

Published:2016-05 Issue: Volume:69 Page:68-78
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Marinelli Fabrizio^ORCID,Parente Angelo

Publisher

Elsevier BV

Subject

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

Reference43 articles.

1. Appa G, Pitsoulis L, Williams H. Handbook on modelling for discrete optimization. International series in operations research & management science, vol. 88. US: Springer; 2006.

2. Polynomial algorithms for special cases of the balanced complete bipartite subgraph problem;Arbib;J Comb Math Comb Comput,1999

3. Conflict graphs in integer programming;Atamtürk;Eur J Oper Res,2000

4. Facets of the balanced (acyclic) induced subgraph polytope;Barahona;Math Program,1989

5. Beasley JE. Lagrangean relaxation. In: Reeves C, editor. Modern heuristic techniques for combinatorial problems. Advanced topics in computer science series. London: McGraw-Hill; 1995. p. 243–303.

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

1. Maximum weighted induced forests and trees: new formulations and a computational comparative review;International Transactions in Operational Research;2021-10-31

2. A matheuristic approach for the maximum balanced subgraph of a signed graph;RAIRO - Operations Research;2021-09

3. Negative (and positive) circles in signed graphs: A problem collection;AKCE International Journal of Graphs and Combinatorics;2018-04-01

4. Negative Circles in Signed Graphs: A Problem Collection;Electronic Notes in Discrete Mathematics;2017-12