Circuit and bond polytopes on series-parallel graphs (Q1751117): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disopt.2015.04.001 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Circuit Polytope: Facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cycle cones and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut approach to the cardinality constrained circuit problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cardinality constrained cycle and path polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear description of the 3-cycle polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Linear Description of the k-cycle Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stable set polytope of a series-parallel graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Graph Partitioning Polytope on Series-Parallel and 4-Wheel Free Graphs / 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: 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: The Steiner Traveling Salesman Polytope and Related Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral Characterization of Discrete Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matching Polytope has Exponential Extension Complexity / 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: Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: When the cut condition is enough / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel recognition of series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of series-parallel networks / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISOPT.2015.04.001 / rank
 
Normal rank

Latest revision as of 08:14, 11 December 2024

scientific article
Language Label Description Also known as
English
Circuit and bond polytopes on series-parallel graphs
scientific article

    Statements

    Circuit and bond polytopes on series-parallel graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    circuit polytope
    0 references
    series-parallel graph
    0 references
    extended formulation
    0 references
    bond polytope
    0 references

    Identifiers

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