<p>can someone point out to me a solution or give advice on how to formulate as efficiently as possible in terms of number of bits the minimum Steiner tree problem as a 0-1 quadratic optimization problem?</p>

<p>Edit [Context]: I am trying to find useful applications of quantum optimization (which attacks 0-1 quadratic unconstrained problems) and I thought that the minimum Steiner tree problem was a great starting point.</p>

CC BY-SA 3.0
2013-09-15T06:13:46.593Z
This question might be more suitable for [scicomp.se].
Kaveh
CC BY-SA 3.0
2013-09-15T08:24:45.177Z
I don't think it's necessarily out of scope. But I would like the OP to provide some context for why they'd want the answer to this question.
Suresh Venkat
CC BY-SA 3.0
2013-09-16T03:29:29.570Z
I am sorry I am not familiar with stackexchange and I thought this was the most appropriate venue. I am now about to provide context!
Davide Venturelli
CC BY-SA 3.0
2013-09-18T01:36:43.803Z
done! added context
Davide Venturelli
<graph-algorithms><optimization><tree><integer-programming>
Quadratic Binary Optimization formulation of Steiner Tree problem
Davide Venturelli
# Quadratic Binary Optimization formulation of Steiner Tree problem

(Asked by: username_0 on 2013-09-15)

can someone point out to me a solution or give advice on how to formulate as efficiently as possible in terms of number of bits the minimum Steiner tree problem as a 0-1 quadratic optimization problem?

Edit [Context]: I am trying to find useful applications of quantum optimization (which attacks 0-1 quadratic unconstrained problems) and I thought that the minimum Steiner tree problem was a great starting point.

**Tags:** graph-algorithms, optimization, tree, integer-programming
> **Comments:**
> **username_1**: This question might be more suitable for [scicomp.se].  
> **username_2**: I don't think it's necessarily out of scope. But I would like the OP to provide some context for why they'd want the answer to this question.  
> **username_0**: I am sorry I am not familiar with stackexchange and I thought this was the most appropriate venue. I am now about to provide context!  
> **username_0**: done! added context  

---

## 0 answers

