A partial answer, based on commentary above:
We can look for rational points on the ellipse $2x^2+y^2=3$. Essentially, we're setting $x = \frac a c, y = \frac b c$. The method is simple: a line with a rational slope passing through one rational point on a curve intersects at another rational point (assuming it intersects).
There is one obvious rational point: $(1,1)$. Because the ellipse is symmetrical, we can instead use $(-1,-1)$ as our initial rational point. Our line with rational slope $t$ is then $y= t(x+1)-1$. We can plug this in for $y$ in the ellipse's equation, and we get:
$$(2+t^2)x^2 + (2t^2-2t)x + (t^2 - 2t - 2) = 0$$
This can be solved by the quadratic formula, and the result is
$$(x,y) = \left(\frac{2+2t-t^2}{t^2+2},\frac{t^2+4t-2}{t^2+2}\right)$$
And since we set $c=1$, we can multiply through by the denominator to get
$$(a,b,c) = \left(2+2t-t^2,t^2+4t-2,t^2+2\right)$$
Now since $t$ is rational, we can substitute $t = \frac p q$ where $p,q \in \mathbb{N}$. Doing so, then multiplying through by $q^2$ (which appears in the denominators of all three), we get:
$$(a,b,c) = (2q^2+2pq-p^2, p^2+4pq-2q^2, p^2+2q^2)$$
This is a parametrized solution that gives integer solutions only. However, due to various quirks, it does not give only primitive solutions--if $p$ is even, or if $3 \mid p-q$, we end up with numbers that must be divided by their gcd to get a primitive solution. (We can see, for instance, that with $p$ even, $a,b,c$ will also all be even.) Additionally, if $\gcd(p,q) > 1$, it will find a non-primitive solution.
Here is a Desmos sheet that lets you play with $p,q$ and find various solutions. Note that if we get a negative solution, well, we're squaring it anyway, so you can just remove the negative sign.
Now, this ought to give all solutions. However, I'm uncertain that it does so, and don't have a proof. For instance, an answer linked above gives a different parametrization:
$$(a, b, c) = (p^2 - 3q^2, p^2 + 6pq + 3q^2, p^2 + 2pq + 3q^2)$$
which also gives solutions that must be divided by the gcd to find primitive solutions. I haven't checked whether the two parametrizations give the same solution set.
Edit: Barring something weird happening with large $p,q$, these two parametrizations would appear generate two disjoint solution sets (using Sage). There may well be other parametrizations that produce other solution sets.
Edit 2: Neither of these solution sets contains $(1, 19, 11)$, which is noted as a solution in another answer. So these two parametrizations don't hit all solutions.