[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Help-glpk] subtour elimination
From: |
Robert Fourer |
Subject: |
Re: [Help-glpk] subtour elimination |
Date: |
Wed, 26 May 2004 09:10:07 -0500 |
User-agent: |
Microsoft-Entourage/10.0.0.1309 |
In reply to the message from >>> Livio Bertacco <address@hidden>
received 5/25/04 12:33 PM:
> Is it possible to "generate" subtour elimination constraints in MathProg
> with a single expression (iterated over all subsets of V)?
> That is, given a complete graph, I want to add all constraints like:
>
> for all S subset of V:
> Sum, over all (i,j) in S, of x(i,j) <= |S| - 1
>
> I can't find a way to define the set of subsets of V.
For a way to effectively iterate over all subsets of a set using AMPL (and
thus presumably MathProg), see question 4.4 at www.ampl.com/FAQ.
Bob Fourer
address@hidden