Symmetry-breaking constraints for packing identical rectangles within polyhedra
type: Item
instance of: scholarly article
title: Symmetry-breaking constraints for packing identical rectangles within polyhedra
zbMATH Open document ID: 1267.90117
author: Yanyan Li
published in: Optimization Letters
publication date: 2013-03-07T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6142314
zbMATH Keywords: packing of rectangles
zbMATH Keywords: MIP models
zbMATH Keywords: symmetry-breaking constraints
zbMATH Keywords: algorithms
MaRDI profile type: Publication
full work available at URL: s11590-011-0425-9
OpenAlex ID: W2150001295
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
cites work: Method of sentinels for packing items within arbitrary convex regions
cites work: A note on an L-approach for solving the manufacturer's pallet loading problem
cites work: Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
cites work: Q4883383
cites work: A heuristic approach for packing identical rectangles in convex regions
cites work: Encyclopedia of Optimization
cites work: Complexity and approximation of an area packing problem
cites work: Cutting circles and polygons from area-minimizing rectangles
cites work: Integer linear programming models for 2-staged two-dimensional knapsack problems
cites work: Using sentinels to detect intersections of convex and nonconvex polygons
DOI: 10.1007/S11590-011-0425-9
description: scientific article; zbMATH DE number 6142314