Classification of attacks against lattices
You're describing methods of solving LWE via reduction to SVP. In particular:


Sieving and Enumeration are methods of solving exact SVP
Basis reduction is a method of solving approximate SVP


There are additionally ways of solving LWE directly (the classic example is the Arora-Ge attack, which works when the noise distribution is too concentrated).

Daniele Micciancio has a webpage on lattice cryptography where you can see some discussion of this/links to papers.

While I haven't read the following thesis:


Michael Walter's thesis has sections on both enumeration and basis reduction.
Rachel Player's thesis seems to include include a summary of direct attacks on LWE, and a section of lattice basis reduction.