help-glpk
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Help-glpk] Bravo on Proximity Search


From: Meketon, Marc
Subject: Re: [Help-glpk] Bravo on Proximity Search
Date: Mon, 16 Sep 2013 21:06:39 -0500

I just found out that Giorgio Sartor wrote the GLPK implementation of the proximity search while he was an assistant researcher under Prof. Fischetti.  Well done Giorgio!

 

From: help-glpk-bounces+address@hidden [mailto:help-glpk-bounces+address@hidden On Behalf Of Meketon, Marc
Sent: Monday, September 16, 2013 6:48 PM
To: address@hidden
Cc: Monaci Michele
Subject: [Help-glpk] Bravo on Proximity Search

 

I have begun using the “proximity search” option (--proxy) and set for 120 seconds.  On the problem that I’m solving, it is doing an outstanding job of getting solutions within 10% (and sometimes even within 1%) of optimal.  [It might take GLPK 30-60 minutes longer to obtain provably optimal results.]  It’s speeding up my solution times considerably.

 

I am very impressed with this option.  Good job Andrew.  And thanks to Prof Fischetti and Michele Monaci for providing the original research.

 

-Marc

 


This e-mail and any attachments may be confidential or legally privileged. If you received this message in error or are not the intended recipient, you should destroy the e-mail message and any attachments or copies, and you are prohibited from retaining, distributing, disclosing or using any information contained herein. Please inform us of the erroneous delivery by return e-mail. Thank you for your cooperation.



This e-mail and any attachments may be confidential or legally privileged. If you received this message in error or are not the intended recipient, you should destroy the e-mail message and any attachments or copies, and you are prohibited from retaining, distributing, disclosing or using any information contained herein. Please inform us of the erroneous delivery by return e-mail. Thank you for your cooperation.

reply via email to

[Prev in Thread] Current Thread [Next in Thread]