Computing Maximal Copies of Polyhedra Contained in a Polyhedron (Q5246363): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Integer Programming: A New Approach to Integrate CP and MIP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest placement of one convex polygon inside another / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Maximal Regular Polyhedra Inscribed in a Regular Polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsolved problems in geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of Croft on optimally nested regular polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some basic problems in computational convexity. I. Containment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5729288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large regular simplices contained in a hypercube / rank
 
Normal rank

Latest revision as of 23:05, 9 July 2024

scientific article; zbMATH DE number 6427831
Language Label Description Also known as
English
Computing Maximal Copies of Polyhedra Contained in a Polyhedron
scientific article; zbMATH DE number 6427831

    Statements

    Identifiers

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