Re: [AMPL 16227] Maximum Flow of a graph

[AMPL Google Group]

Can you elaborate more in your problem? You could send your updated model, data and graph and we could look into the problem.

--
Paras Tiwari
am...@googlegroups.com

{#HS:566009915-5808#}

On Sat, Apr 21, 2018 at 1:28 PM UTC, Ampl Modeling Language <am...@googlegroups.com> wrote:

Hello,

I would like to calculate the Maximum flow of such network where weights' of edges are extraverted edges. I illustrated the graph below.

I tried the examples which are given in chapter 8, but none of them worked by modifying the data file where the routes are specified.

--
You received this message because you are subscribed to the Google Groups "AMPL Modeling Language" group.
To unsubscribe from this group and stop receiving emails from it, send an email to ampl+uns...@googlegroups.com.
To post to this group, send email to am...@googlegroups.com.
Visit this group at https://groups.google.com/group/ampl.
For more options, visit https://groups.google.com/d/optout.