A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem
type: Item
instance of: scholarly article
title: A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem
zbMATH Open document ID: 1349.90819
author: Fabrizio Marinelli
author: Angelo Parente
published in: Computers \& Operations Research
publication date: 2016-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6654149
zbMATH Keywords: network matrix
zbMATH Keywords: signed graph
zbMATH Keywords: independent set
zbMATH Keywords: maximum balanced induced subgraph
zbMATH Keywords: vertex frustration
describes a project that uses: Mathematica
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.cor.2015.12.004
OpenAlex ID: W2292659810
cites work: Handbook on modelling for discrete optimization.
cites work: Q4264549
cites work: Conflict graphs in solving integer programming problems
cites work: Facets of the balanced (acyclic) induced subgraph polytope
cites work: Converting Linear Programs to Network Problems
cites work: Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
cites work: Set packing relaxations of some integer programs
cites work: Automatic identification of embedded network rows in large-scale optimization models
cites work: Vertex cover: Further observations and further improvements
cites work: Graph Bipartization and via minimization
cites work: Q3577833
cites work: An exact approach to the problem of extracting an embedded network matrix
cites work: Solving VLSI design and DNA sequencing problems using bipartization of graphs
cites work: Strong lift-and-project cutting planes for the stable set problem
cites work: Detecting embedded networks in LP using GUB structures and independent set algorithms
cites work: Extracting pure network submatrices in linear programs using signed graphs.
cites work: Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs
cites work: On the notion of balance of a signed graph
cites work: Signed graphs for portfolio analysis in risk management
cites work: Q3236253
cites work: Q3236252
cites work: Separator-based data reduction for signed graph balancing
cites work: A \((\Delta / 2)\)-approximation algorithm for the maximum independent set problem
cites work: A branch-and-cut algorithm for the maximum cardinality stable set problem
cites work: Q4221106
cites work: A decomposition theory for matroids. V: Testing of matrix total unimodularity
cites work: Signed graphs
cites work: Erratum to: T. Zaslavsky, signed graphs
DOI: 10.1016/J.COR.2015.12.004
description: scientific article; zbMATH DE number 6654149