It is well-known that when we maximize a 1-norm, e.g., $\|Ax\|_1$, we can use binary variables and obtain a mixed-integer convex problem (otherwise maximizing 1-norm is non-convex). I am mentioning this in a report, but I need a reference. I checked YALMIP logical programming post on this page, it is relevant but not fully the same.
Do you know which source I can cite? I am using YALMIP to solve such a problem, and it automatically reformulates as explained.