Exact and approximation algorithms for a soft rectangle packing problem
type: Item
instance of: scholarly article
title: Exact and approximation algorithms for a soft rectangle packing problem
zbMATH Open document ID: 1306.90101
DOI: 10.1080/02331934.2012.728217
author: Armin Fügenschuh
author: Konstanty Junosza-Szaniawski
author: Zbigniew Lonc
published in: Optimization
publication date: 2014-10-24T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 52C15
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68W35
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6361522
zbMATH Keywords: partitioning
zbMATH Keywords: rectangle packing
zbMATH Keywords: soft rectangles
zbMATH Keywords: geometric arrangement problems
zbMATH Keywords: mixed-integer linear programming
zbMATH Keywords: mixed-integer nonlinear programming
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/02331934.2012.728217
OpenAlex ID: W2062065632
cites work: Partitioning a square into rectangles: NP-Completeness and approximation algorithms
cites work: Disjunctive Cuts for Nonconvex MINLP
cites work: Branching and bounds tighteningtechniques for non-convex MINLP
cites work: On Polyhedral Approximations of the Second-Order Cone
cites work: Cutting circles into equal area pieces
cites work: On the Significance of Solving Linear Programming Problems with Some Integer Variables
cites work: Integer linear programming models for topology optimization in sheet metal design
cites work: The Decomposition of a Rectangle into Rectangles of Minimal Perimeter
cites work: On the Solution of Discrete Programming Problems
cites work: PACKING SOFT RECTANGLES
cites work: An approximation algorithm for dissecting a rectangle into rectangles with specified areas
cites work: How good are slicing floorplans?
description: scientific article; zbMATH DE number 6361522