A matheuristic approach for the maximum balanced subgraph of a signed graph

DOI10.1051/RO/2021150zbMATH Open1485.90116OpenAlexW3200437044MaRDI QIDQ5034728FDOQ5034728

Authors: Jorge Reynaldo Moreno Ramírez, Y. Frota, Simone de Lima Martins 

Publication date: 21 February 2022

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2021150

Recommendations

• The maximum balanced subgraph of a signed graph: applications and solution approaches
• A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph
• Maximum balanced subgraph problem parameterized above lower bound
• Maximum balanced subgraph problem parameterized above lower bound
• Approximation algorithms for balancing signed graphs
• scientific article; zbMATH DE number 4008420
• The signed \(k\)-submatchings in graphs
• Algorithms and hardness results for the maximum balanced connected subgraph problem
• A note on signed \(k\)-submatching in graphs
• On pseudo-balancing of path-induced signed graphs

zbMATH Keywords

local searchmatheuristicbalanced signed graph

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Polynomial optimization (90C23)

Cited In (5)

• Maximum balanced subgraph problem parameterized above lower bound
• The maximum balanced subgraph of a signed graph: applications and solution approaches
• A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem
• Maximum balanced subgraph problem parameterized above lower bound
• A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph

This page was built for publication: A matheuristic approach for the maximum balanced subgraph of a signed graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5034728)