770 / 1224
•
A heuristic
combining SA & scoring
for the binary part
b
•
A quasi-Newton
for the
continuous part
t = x²
(optimisation)
30s – 120s
(parallelised, ...)
HIPO: < 240 s (not parallelised)
MILP solver CPLEX: ≈ 48 hrs
< 1.0s
HIPO
MILP
Inverse Planning – using
HIPO
=
=
=
feasible
kASDP
N
k
N
l
i
jkl
lk
K lk k
i
j
d Sxb
d
1
1
,
2
~
(x)
) ,
, (
1
w t
r f
fw f
M
m
m m
=
=
=
Minimise