Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron (Q839668): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The <i>k</i>-Edge-Connected Spanning Subgraph Polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem on a graph and some related integer polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-edge connected polyhedra on series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem in graphs with some excluded minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of Survivable Networks: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On perfectly two-edge connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of survivable networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-edge-connected subgraph polyhedron / rank
 
Normal rank

Latest revision as of 23:20, 1 July 2024

scientific article
Language Label Description Also known as
English
Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron
scientific article

    Statements

    Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron (English)
    0 references
    2 September 2009
    0 references
    0 references
    \(k\)-edge connectivity
    0 references
    half integrality
    0 references
    polyhedron
    0 references
    linear relaxation
    0 references
    forbidden minors
    0 references
    0 references
    0 references
    0 references