New exact algorithms for planar maximum covering location by ellipses problems

•Exact algorithms for the Planar Maximum Covering Location by Ellipses (and by Ellipses with rotation) problem.•Optimal solutions for instances with up to seven hundred points and five ellipses.•There are at most six angles of rotation for an ellipse with fixed major and minor axes to contain three given points.