The negative cycles polyhedron and hardness of checking some polyhedral properties (Q646701): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1007/s10479-010-0690-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997609492 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59560546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: How good are convex hull algorithms? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual methods for vertex and facet enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of recognizing linear systems with certain integrality properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all vertices of a polyhedron is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recognizing integer polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient enumeration of the vertices of polyhedra associated with network LP's / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank

Latest revision as of 16:30, 4 July 2024

scientific article
Language Label Description Also known as
English
The negative cycles polyhedron and hardness of checking some polyhedral properties
scientific article

    Statements

    The negative cycles polyhedron and hardness of checking some polyhedral properties (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 November 2011
    0 references
    flow polytope
    0 references
    0/1-polyhedron
    0 references
    vertex
    0 references
    extreme direction
    0 references
    enumeration problem
    0 references
    negative cycles
    0 references
    directed graph
    0 references
    half-integral polyhedra
    0 references
    maximum support
    0 references
    hardness of approximation
    0 references

    Identifiers