  We give algorithms for computing multiplier ideals using Gr\"obner bases in
Weyl algebras. The algorithms are based on a newly introduced notion which is a
variant of Budur--Musta\c{t}\v{a}--Saito's (generalized) Bernstein--Sato
polynomial. We present several examples computed by our algorithms.
