1) Series of turret designs 
In complexity theory the class APX (an abbreviation of `approximable`) is the set of NP optimization problems that allow polynomial-time approximation algorithms with approximation ratio bounded by a constant (or constant-factor approximation algorithms for short). In simple terms, problems in this class have efficient algorithms that can find a.....
Series of turret designs [FR]
Amsterdam Power Exchange