Irregular polyomino tiling via integer programming with application in phased array antenna design
DOI10.1007/S10898-015-0354-8zbMATH Open1348.90544OpenAlexW1874846785MaRDI QIDQ288219FDOQ288219
Authors: Serdar Karademir, Oleg A. Prokopyev, Robert J. Mailloux 
Publication date: 25 May 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0354-8
Recommendations
- A new mathematical model for tiling finite regions of the plane with polyominoes
- A mixed-integer model for two-dimensional polyominoes strip packing and tiling problems
- scientific article; zbMATH DE number 1182905
- Optimal Partial Tiling of Manhattan Polyominoes
- A neural network approach to tiling problems
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90) Combinatorial optimization (90C27)
Cites Work
- Efficient global optimization of expensive black-box functions
- A Mathematical Theory of Communication
- Research Problems in Discrete Geometry
- Title not available (Why is that?)
- Algebraic languages and polyominoes enumeration
- Entropy optimization and mathematical programming
- Combinatorial aspects of \(L\)-convex polyominoes
- Branch-and-price: Column generation for solving huge integer programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Combinatorial properties of polyominoes
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- Branching in branch-and-price: A generic scheme
- Structural information content of networks: graph entropy based on local vertex functionals
- Complementary column generation and bounding approaches for set partitioning formulations
- Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
- The number of Z-convex polyominoes
- The minimum-entropy set cover problem
- Constrained maximum-entropy sampling
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Tiling with sets of polyominoes
- Set Partitioning: A survey
- Title not available (Why is that?)
- A variance-based method to rank input variables of the mesh adaptive direct search algorithm
- Tiling Deficient Rectangles with Trominoes
- Title not available (Why is that?)
- An introduction to cryptography.
- Tiling with polyominoes
- The Set-Partitioning Problem: Set Covering with Equality Constraints
- The undecidability of the domino problem
- On the Set-Covering Problem
- Title not available (Why is that?)
- Enumerations of lattice animals and trees
- Hard tiling problems with simple tiles
- Computational study of large-scale \(p\)-median problems
- Tight results on minimum entropy set cover
- Intermediate integer programming representations using value disjunctions
Cited In (4)
Uses Software
This page was built for publication: Irregular polyomino tiling via integer programming with application in phased array antenna design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q288219)
