Packing ellipses in an optimized convex polygon (Q2274890): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q128021431, #quickstatements; #temporary_batch_1722421251154
 
(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/s10898-019-00777-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2942658286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-phi-functions and optimal packing of ellipses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimized ellipse packings in regular polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of cutting complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing ellipsoids into volume-minimizing rectangular boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting ellipses from area-minimizing rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing ellipsoids by nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear programming model with implicit variables for packing ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing circular-like objects in a rectangular container / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimized Object Packings Using Quasi-Phi-Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phi-functions for 2D objects formed by line segments and circular arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128021431 / rank
 
Normal rank

Latest revision as of 12:26, 31 July 2024

scientific article
Language Label Description Also known as
English
Packing ellipses in an optimized convex polygon
scientific article

    Statements

    Packing ellipses in an optimized convex polygon (English)
    0 references
    0 references
    1 October 2019
    0 references
    packing
    0 references
    ellipses
    0 references
    continuous rotations
    0 references
    convex polygon
    0 references
    phi-function technique
    0 references
    nonlinear optimization
    0 references
    0 references
    0 references

    Identifiers