Exact and approximation algorithms for a soft rectangle packing problem

DOI10.1080/02331934.2012.728217MaRDI QIDQ2926482zbMATH OpenOpenAlexFDO

Authors Armin Fügenschuh, Konstanty Junosza-Szaniawski, Zbigniew Lonc

Publication date 24 October 2014

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2012.728217

zbMATH Keywords

mixed-integer nonlinear programmingrectangle packingmixed-integer linear programmingpartitioninggeometric arrangement problemssoft rectangles

Mathematics Subject Classification ID

Convex programming (90C25) Analysis of algorithms (68W40) Approximation algorithms (68W25) Mixed integer programming (90C11) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• scientific article; zbMATH DE number 4091172
• Optimal rectangle packing
• On three soft rectangle packing problems with guillotine constraints
• PACKING SOFT RECTANGLES
• A novel non-linear approach to minimal area rectangular packing

Cites work

• An approximation algorithm for dissecting a rectangle into rectangles with specified areas
• Branching and bounds tighteningtechniques for non-convex MINLP
• Cutting circles into equal area pieces
• Disjunctive Cuts for Nonconvex MINLP
• How good are slicing floorplans?
• Integer linear programming models for topology optimization in sheet metal design
• On Polyhedral Approximations of the Second-Order Cone
• On the Significance of Solving Linear Programming Problems with Some Integer Variables
• On the Solution of Discrete Programming Problems
• PACKING SOFT RECTANGLES
• Partitioning a square into rectangles: NP-Completeness and approximation algorithms
• The Decomposition of a Rectangle into Rectangles of Minimal Perimeter

Cited in

(4)

• An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules
• An approximation algorithm for optimal piecewise linear interpolations of bounded variable products
• On three soft rectangle packing problems with guillotine constraints
• PACKING SOFT RECTANGLES

This page was built for publication: Exact and approximation algorithms for a soft rectangle packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2926482)