Irregular polyomino tiling via integer programming with application in phased array antenna design

DOI10.1007/S10898-015-0354-8MaRDI QIDQ288219zbMATHOpenAlexFDO

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

zbMATH Keywords

entropypolyominophased array antennaset partitioning

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 687006 (Why is no real title available?)
• scientific article; zbMATH DE number 2046042 (Why is no real title available?)
• scientific article; zbMATH DE number 780788 (Why is no real title available?)
• scientific article; zbMATH DE number 4184623 (Why is no real title available?)
• scientific article; zbMATH DE number 3073200 (Why is no real title available?)
• A Mathematical Theory of Communication
• A variance-based method to rank input variables of the mesh adaptive direct search algorithm
• Algebraic languages and polyominoes enumeration
• An introduction to cryptography.
• Branch-and-price: Column generation for solving huge integer programs
• Branching in branch-and-price: A generic scheme
• Combinatorial aspects of \(L\)-convex polyominoes
• Combinatorial properties of polyominoes
• Complementary column generation and bounding approaches for set partitioning formulations
• Computational study of large-scale \(p\)-median problems
• Constrained maximum-entropy sampling
• Efficient global optimization of expensive black-box functions
• Entropy optimization and mathematical programming
• Enumerations of lattice animals and trees
• Hard tiling problems with simple tiles
• Intermediate integer programming representations using value disjunctions
• Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization
• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
• On the Set-Covering Problem
• Research Problems in Discrete Geometry
• Set Partitioning: A survey
• Structural information content of networks: graph entropy based on local vertex functionals
• The Set-Partitioning Problem: Set Covering with Equality Constraints
• The minimum-entropy set cover problem
• The number of Z-convex polyominoes
• The undecidability of the domino problem
• Tight results on minimum entropy set cover
• Tiling Deficient Rectangles with Trominoes
• Tiling with polyominoes
• Tiling with sets of polyominoes
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems

Cited in

(4)

• A neural network approach to tiling problems
• A new mathematical model for tiling finite regions of the plane with polyominoes
• scientific article; zbMATH DE number 2058177 (Why is no real title available?)
• An integer linear programming approach to solving the Eternity puzzle

Describes a project that uses

Uses Software

• CPLEX
• EGO

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)