Packing problems on generalised regular grid: Levels of abstraction using integer linear programming
Packing a designated set of shapes on a regular grid is an important class of operations research problems that has been intensively studied for more than six decades. Representing a d-dimensional discrete grid as Zd, we formalise the generalised regular grid (GRG) as a surjective function from Zd t...
Main Authors: | Hao Hua, Benjamin Dillenburger |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2023-12-01
|
Series: | Graphical Models |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S1524070323000358 |
Similar Items
-
Ammann Tilings in Symplectic Geometry
by: Fiammetta Battaglia, et al.
Published: (2013-03-01) -
Linear and integer programming /
by: 290647 Zionts, Stanley
Published: (1974) -
A New Algorithms in Mixed Integer Programming Problems
by: Basim Hassan, et al.
Published: (2010-12-01) -
Linear and integer programming : theory and practice /
by: 437726 Sierksma, Gerard
Published: (2002) -
Wind Farm Cable Connection Layout Optimization Using a Genetic Algorithm and Integer Linear Programming
by: Eduardo J. Solteiro Pires, et al.
Published: (2023-12-01)