An exact approach to the problem of extracting an embedded network matrix (Q716336): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Cid Carvalho De Souza / rank
Normal rank
 
Property / author
 
Property / author: Cid Carvalho De Souza / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: XPRESS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2011.01.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4299572240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for finding embedded network structure in mathematical programmes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the balanced (acyclic) induced subgraph polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A good submatrix is hard to find / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic identification of embedded network rows in large-scale optimization models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting pure network submatrices in linear programs using signed graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut solver for the maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the maximum cardinality stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of facet producing graphs for vertex packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed graphs / rank
 
Normal rank

Latest revision as of 00:38, 4 July 2024

scientific article
Language Label Description Also known as
English
An exact approach to the problem of extracting an embedded network matrix
scientific article

    Statements

    An exact approach to the problem of extracting an embedded network matrix (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2011
    0 references
    network matrix
    0 references
    signed graph
    0 references
    facets of polyhedra
    0 references
    branch-and-cut
    0 references

    Identifiers