Cutting circles and polygons from area-minimizing rectangles (Q1029696): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 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-007-9274-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039355562 / 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: Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the object dimensions in circle and sphere packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing 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: Integrated container loading software for pulp and paper industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing different-sized circles into a rectangular container / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithms for packing unequal circles into a rectangular container / rank
 
Normal rank
Property / cites work
 
Property / cites work: On genetic algorithms for the packing of polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3879251 / 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: Q5692718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum perimeter rectangles that enclose congruent non-overlapping circles / 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: Column enumeration based decomposition techniques for a class of non-convex MINLP problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5591340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical model and a solution method for the problem of placing various-sized circles into a strip / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approaches to circle packing in a square. With program codes. / 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

Latest revision as of 19:22, 1 July 2024

scientific article
Language Label Description Also known as
English
Cutting circles and polygons from area-minimizing rectangles
scientific article

    Statements

    Cutting circles and polygons from area-minimizing rectangles (English)
    0 references
    0 references
    13 July 2009
    0 references
    0 references
    global optimization
    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
    assignment
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references