Help with Steiner Tree Problem

[Vicedroid]

*Hi everyone I need help with some AMPL code*
I've been trying to recreate the Steiner's Tree Problem in AMPL.
I've been searching but I have no idea how it will be written in Code.

I know that /Steiner seeks to recreate a Sub Graph of Terminal Nodes based
on another Graph of Nodes with the lowest cost of edges/.

This would be my code in AMPL.

*I accept any modification of the Code*

ST.mod <http://ampl.996311.n3.nabble.com/file/t3615/ST.mod>
ST.dat <http://ampl.996311.n3.nabble.com/file/t3615/ST.dat>



--
Sent from: http://ampl.996311.n3.nabble.com/

[Vicedroid]

Hello everyone, I need help with a Code.
I have been trying to recreate the Steiner Tree in AMPL.
This seeks to create a sub graph of Terminal nodes from a given Graph.

Here would be my Code of what I have achieved, however it keeps throwing me
Error.

I would appreciate if you help me complete it

[AMPL Google Group]

This question was already answered here:
https://groups.google.com/g/ampl/c/_wzEcDXdxeQ/m/PE26I8C5CAAJ

--
Robert Fourer
am...@googlegroups.com

{#HS:1503260095-104066#}

On Tue, May 4, 2021 at 1:25 PM UTC, AMPL Modeling Language <am...@googlegroups.com> wrote:

Hello everyone, I need help with a Code.
I have been trying to recreate the Steiner Tree in AMPL.
This seeks to create a sub graph of Terminal nodes from a given Graph.

Here would be my Code of what I have achieved, however it keeps throwing me
Error.

I would appreciate if you help me complete it

ST.mod <http://ampl.996311.n3.nabble.com/file/t3615/ST.mod&gt;
ST.dat <http://ampl.996311.n3.nabble.com/file/t3615/ST.dat&gt;