Cutting ellipses from area-minimizing rectangles (Q2250089): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(7 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-013-0125-3 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: GAMS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LINDO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GloMIQO / rank
 
Normal rank
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-013-0125-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974255097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\alpha BB\): A global optimization method for general constrained nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2930126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Infinite Programming: Theory, Methods, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting circles and polygons from area-minimizing rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylithic modeling and solution approaches using algebraic modeling systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulation and convex relaxation techniques for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all solutions of nonlinearly constrained systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval methods for verifying structural optimality of circle packing configurations in the unit square / rank
 
Normal rank
Property / cites work
 
Property / cites work: GLOMIQO: global mixed-integer quadratic optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column enumeration based decomposition techniques for a class of non-convex MINLP problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-013-0125-3 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:19, 17 December 2024

scientific article
Language Label Description Also known as
English
Cutting ellipses from area-minimizing rectangles
scientific article

    Statements

    Cutting ellipses from area-minimizing rectangles (English)
    0 references
    0 references
    0 references
    4 July 2014
    0 references
    global optimization
    0 references
    non-convex nonlinear programming
    0 references
    mixed integer programming
    0 references
    cutting stock problem
    0 references
    packing problem
    0 references
    shape constraints
    0 references
    non-overlap constraints
    0 references
    design problem
    0 references
    polylithic solution approach
    0 references
    computational geometry
    0 references
    0 references
    0 references
    0 references

    Identifiers