DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES (Q4682163): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Combinatorial optimization and small polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: How good are convex hull algorithms? / 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: The graphical relaxation: A new framework for the symmetric traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete description of the traveling salesman polytope on 8 nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Facets of the Linear Ordering Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal properties of \(0/1\)-polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple 0/1-polytopes / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0218195901000560 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2141917808 / rank
 
Normal rank

Latest revision as of 08:30, 30 July 2024

scientific article; zbMATH DE number 2174814
Language Label Description Also known as
English
DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES
scientific article; zbMATH DE number 2174814

    Statements

    Identifiers