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.

  • $\begingroup$ This question might be more suitable for Computational Science. $\endgroup$
    – Kaveh
    Sep 15 '13 at 6:13
  • $\begingroup$ 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. $\endgroup$ Sep 15 '13 at 8:24
  • $\begingroup$ 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! $\endgroup$ Sep 16 '13 at 3:29
  • $\begingroup$ done! added context $\endgroup$ Sep 18 '13 at 1:36

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.