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

DOI10.1007/s10898-015-0354-8zbMath1348.90544OpenAlexW1874846785MaRDI QIDQ288219

Robert J. Mailloux, Serdar Karademir, Oleg A. Prokopyev

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

Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

An integer linear programming approach to solving the Eternity puzzle

Uses Software

• CPLEX
• EGO

Cites Work

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

This page was built for publication: Irregular polyomino tiling via integer programming with application in phased array antenna design