A computational comparison of compact MILP formulations for the zero forcing number (Q2328106): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q128030770, #quickstatements; #temporary_batch_1722635374576
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2936631157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the \(k\)-forcing number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive programming: Properties of the convex hull of feasible points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing sets and the minimum rank of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing parameters and minimum rank problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational approaches for zero forcing and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic circuits from zero forcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the positive semidefinite zero forcing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some bounds on the zero forcing number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propagation time for zero forcing on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Zero Forcing Number of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A technique for computing the zero forcing number of a graph with a cut-vertex / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128030770 / rank
 
Normal rank

Latest revision as of 23:50, 2 August 2024

scientific article
Language Label Description Also known as
English
A computational comparison of compact MILP formulations for the zero forcing number
scientific article

    Statements

    A computational comparison of compact MILP formulations for the zero forcing number (English)
    0 references
    0 references
    0 references
    0 references
    9 October 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    mixed integer linear programming
    0 references
    compact formulations
    0 references
    valid inequalities
    0 references
    zero forcing
    0 references
    0 references
    0 references
    0 references
    0 references