The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut (Q325409): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Ali Ridha Mahjoub / rank
Normal rank
 
Property / author
 
Property / author: Ali Ridha Mahjoub / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C57 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6640264 / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)-node connected graph
Property / zbMATH Keywords: \(k\)-node connected graph / rank
 
Normal rank
Property / zbMATH Keywords
 
polytope
Property / zbMATH Keywords: polytope / rank
 
Normal rank
Property / zbMATH Keywords
 
separation
Property / zbMATH Keywords: separation / rank
 
Normal rank
Property / zbMATH Keywords
 
branch-and-cut algorithm
Property / zbMATH Keywords: branch-and-cut algorithm / 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.endm.2016.03.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2404189039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the k-edge connected subgraph problem / 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: \(k\)-edge connected polyhedra on series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. / 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: On the linear relaxation of the 2-node connected subgraph polytope / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:42, 12 July 2024

scientific article
Language Label Description Also known as
English
The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut
scientific article

    Statements

    The \(k\)-node connected subgraph problem: polyhedral analysis and branch-and-cut (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 October 2016
    0 references
    \(k\)-node connected graph
    0 references
    polytope
    0 references
    separation
    0 references
    branch-and-cut algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references