Hi Bert,
I won't post any more messages on this thread as problem has shifted from
Optimization in R to Graph Algorithms.
Rest fine
Khris.
On Aug 2, 2012, at 9:13 PM, Bert Gunter [via R] wrote:
> This discussion needs to be taken off (this) list, as it appears to
> have nothing t
Thanks for the response Petr
On Aug 2, 2012, at 11:11 PM, Petr Savicky [via R] wrote:
> On Thu, Aug 02, 2012 at 02:27:43AM -0700, khris wrote:
>
> >
> > On Aug 2, 2012, at 12:39 PM, Petr Savicky [via R] wrote:
> >
> > > On Wed, Aug 01, 2012 at 04:55:30AM -07
On Aug 2, 2012, at 12:39 PM, Petr Savicky [via R] wrote:
> On Wed, Aug 01, 2012 at 04:55:30AM -0700, khris wrote:
> > Hi Petr,
> >
> > It been sometime since I wrote. But here are the latest developments.
> >
> > When I give the binary linear opt prob
Graph matching
problem with bounded degree to Graph isomorphism of bounded degree problem then
our original problem will have tractable solution.
Appreciate any help or pointer which may take us close towards the solutions."
Thanks in advance
Khris.
On Jul 4, 2012, at 8:25 PM, Petr Savicky [via
zer use to use LP relaxation first? Is
there way to control in some way Branch and Bound algorithm used by lpSolve
apart from the going in side the code and tweaking it.
Appreciate your feedback.
Thanks
Khris.
On Jul 4, 2012, at 8:25 PM, Petr Savicky [via R] wrote:
> On Mon, Jul 02, 2012
Thanks Petr for the reply.
Let me do implementation and see how how goes.
Enjoy your vacation.
Rest fine
Khris
On Jul 4, 2012, at 8:25 PM, Petr Savicky [via R] wrote:
> On Mon, Jul 02, 2012 at 06:11:37AM -0700, khris wrote:
>
> > Hi, Petr,
> >
> > >
> &g
Hi, Petr,
>
> Hi Khris:
>
> If i understand the problem correctly, you have a list of (x,y) coordinates,
> where
> some sensor is located, but you do not know, which sensor is there. The
> database
> contains data for each sensor identified in some way, but you do
Hi Menkes,
Thanks for the reply but just academically free license won't work for me. GNU
or more is reqd.
Rest fine
Khris.
On Jun 30, 2012, at 7:21 PM, menkes [via R] wrote:
> Hi Khris,
>
> If all your variables are binary then you may want to check CPLEX and/or
> Gurob
complexity from n^4 to n^2
where n is the number of sensors.
2. Another alternative could be that opt problem may fall in the category of
semi definite programming, then we have efficient solvers for that.
This is the story, appreciate your feedback.
Rest fine
Khris.
--
View this message in context
any more wise advices.
Rest fine
Khris.
--
View this message in context:
http://r.789695.n4.nabble.com/Binary-Quadratic-Opt-tp4633521p4634078.html
Sent from the R help mailing list archive at Nabble.com.
__
R-help@r-project.org mailing list
https
10 matches
Mail list logo