Re: ratio approximation algorithm
- From: "Alex Fraser" <me@xxxxxxxxxxx>
- Date: Tue, 16 Aug 2005 11:19:12 +0100
"Mark Maglana" <mmaglana@xxxxxxxxx> wrote in message
news:1124181130.920740.314610@xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
> I also got the same response from another mailing list I posted to. A
> minor correction though. The method of comparison should probably be
>
> -t.b.d < b.d.x - a.c < t.b.d
Is the tolerance relative or absolute?
If it is absolute, the comparison should be: -t <= bdx - ac <= t
If it is relative, then I think you need: -bdtx <= bdx - ac <= bdtx
In either case though, it is probably better to compute the range of
acceptable values of ac.
> I was wondering if it would be better to have the B*D products computed
> in advance and saved inside of a database.
If that is appropriate, you may as well compute every possible value of x in
advance.
Alex
.
- References:
- ratio approximation algorithm
- From: Mark Maglana
- Re: ratio approximation algorithm
- From: CTips
- Re: ratio approximation algorithm
- From: Mark Maglana
- ratio approximation algorithm
- Prev by Date: Re: Travelling Salesman problem -- Finding shortest path in ship warehouse
- Next by Date: efficient way of processing m combinations of n numbers in p sets
- Previous by thread: Re: ratio approximation algorithm
- Next by thread: Re: ratio approximation algorithm
- Index(es):
Relevant Pages
|
