Critical extreme points of the 2-edge connected spanning subgraph polytope (Q2583127): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-005-0654-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2123324452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two-connected subgraph polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Polytope Related to the Design of Survivable Communication Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>k</i>-Edge-Connected Spanning Subgraph Polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929516 / 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: Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs / 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: On the Polytope of the (1,2)-Survivable Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical extreme points of the 2-edge connected spanning subgraph polytope / 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: Solving the Two-Connected Network with Bounded Meshes Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4515976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral results for two-connected networks with bounded rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Edge-Disjoint Hop-Constrained Paths and Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of Survivable Networks: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-edge connected spanning subgraphs and polyhedra / 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: Steiner problem in Halin networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized steiner problem in series-parallel networks / rank
 
Normal rank

Latest revision as of 15:12, 11 June 2024

scientific article
Language Label Description Also known as
English
Critical extreme points of the 2-edge connected spanning subgraph polytope
scientific article

    Statements

    Critical extreme points of the 2-edge connected spanning subgraph polytope (English)
    0 references
    0 references
    0 references
    13 January 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    Polytope
    0 references
    Cut
    0 references
    2-edge connected graph
    0 references
    Critical extreme point
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references