Upper Bounds on the Covering Number of Galois-Planes with Small Order |
| |
Authors: | T Illés D Pisinger |
| |
Institution: | (1) Dept. of OR, Eötvös Lórénd Universìty, Kecskeméti u.10-12, H-1063 Budapest;(2) DIKU, University of Copenhagen, Universitotsparken 1, DK-2100 Copenhagen |
| |
Abstract: | Our paper deals with the covering number of finite projective planes which is related to an unsolved question of P. Erdös. An integer linear programming (ILP) formulation of the covering number of finite projective planes is introduced for projective planes of given orders. The mathematical programming based approach for this problem is new in the area of finite projective planes. Since the ILP problem is NP-hard and may involve up to 360.000 boolean variables for the considered problems, we propose a heuristic based on Simulated Annealing. The computational study gives a new insight into the structure of projective planes and their (minimal) blocking sets. This computational study indicates that the current theoretical results may be improved. |
| |
Keywords: | Galois-plane blocking sets 0-1 programming simulated annealing |
本文献已被 SpringerLink 等数据库收录! |
|