A computational comparison of compact MILP formulations for the zero forcing number

DOI10.1016/j.dam.2019.03.027zbMath1421.05039WikidataQ128030770 ScholiaQ128030770MaRDI QIDQ2328106

Agostinho Agra, Cristina Requejo, Jorge Orestes Cerdeira

Publication date: 9 October 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10773/27228

zbMATH Keywords

valid inequalities; mixed integer linear programming; zero forcing; compact formulations

Mathematics Subject Classification ID

90C10: Integer programming

90C05: Linear programming

05C15: Coloring of graphs and hypergraphs

Related Items

Improved Computational Approaches and Heuristics for Zero Forcing

Uses Software

• R
• XPRESS

Cites Work

• Unnamed Item
• Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
• A technique for computing the zero forcing number of a graph with a cut-vertex
• Propagation time for zero forcing on a graph
• Upper bounds on the \(k\)-forcing number of a graph
• Zero forcing parameters and minimum rank problems
• Disjunctive programming: Properties of the convex hull of feasible points
• Computational approaches for zero forcing and related problems
• Some bounds on the zero forcing number of a graph
• Logic circuits from zero forcing
• Zero forcing sets and the minimum rank of graphs
• The Zero Forcing Number of Graphs
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
• On the complexity of the positive semidefinite zero forcing number