Upper bounds on the covering number of Galois-planes with small order

DOI10.1023/A:1026517829321zbMath0967.90082MaRDI QIDQ5933518

Tibor Illés, David Pisinger

Publication date: 3 September 2001

Published in: Journal of Heuristics (Search for Journal in Brave)

zbMATH Keywords

simulated annealing0-1 programmingblocking setscovering number of finite projective planesGalois-planeinteger linear programming

Mathematics Subject Classification ID

Finite affine and projective planes (geometric aspects) (51E15) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial aspects of finite geometries (05B25) Blocking sets, ovals, (k)-arcs (51E21) Boolean programming (90C09)

Related Items (1)

Random constructions and density results

This page was built for publication: Upper bounds on the covering number of Galois-planes with small order