Optimal placement of rectangles on a plane with fixed objects
DOI10.1134/S0005117917090090zbMath1380.49027OpenAlexW2756194389MaRDI QIDQ1687016
T. I. Keiner, Gennady Grigorjevich Zabudsky
Publication date: 18 December 2017
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117917090090
integer programmingequivalence classesplanerectanglesoptimal placement problemminimax criterioninfluence zoneminisum criterion
Integer programming (90C10) Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27) Existence of solutions for minimax problems (49J35) Optimality conditions for minimax problems (49K35)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem
- Model building and location problem solving in a plane with forbidden gaps
- Solving a maximin location problem on the plane with given accuracy
- Local search of orthogonal packings using the lower bounds
- Search region contraction of the Weber problem solution on the plane with rectangular forbidden zones
- Artificial immune system algorithms for the multivariant problem of the telecommunications centers location
- Locating two obnoxious facilities using the weighted maximin criterion
This page was built for publication: Optimal placement of rectangles on a plane with fixed objects