Re: AVL tree silently accept duplicate keys

Sorry, I was not paying attention and replied to the wrong email. Erwin Kalvelagen Amsterdam Optimization Modeling Group er...@amsterdamoptimization.com https://www.amsterdamoptimization.com

Re: AVL tree silently accept duplicate keys

Operator error!! Erwin Kalvelagen Amsterdam Optimization Modeling Group er...@amsterdamoptimization.com https://www.amsterdamoptimization.com

Re: AVL tree silently accept duplicate keys

On Mon, 2020-08-10 at 14:28 +0200, Domingo Alvarez Duarte wrote: > Hello ! > > Replacing usages of AVL tree by SplayTree I found that AVL tree > silently  > accepts duplicate keys on "avl_insert_node" see example bellow, there > is  > only one way to find by key "avl_find_node" which make it

Re: How to retrieve intermediate solutions of MIP problems without interrupting the solver?

Hello Heinrich ! Thank you for reply ! My bad, I did followed the code instead of reading the manual ! There is a old saying: When everything else fails, read the  manual ! Cheers ! On 10/8/20 11:56, Heinrich Schuchardt wrote: On 10.08.20 11:47, Domingo Alvarez Duarte wrote: Hello Yuri !

Re: How to retrieve intermediate solutions of MIP problems without interrupting the solver?

Hello Yuri ! Following the code again I found this lines in examples/glpsol.c: #ifdef GLP_CB_FUNC /* 05/IV-2016 */ {  extern void GLP_CB_FUNC(glp_tree *, void *);     csa->iocp.cb_func = GLP_CB_FUNC;     csa->iocp.cb_info = NULL; } #endif It seems

Re: How to retrieve intermediate solutions of MIP problems without interrupting the solver?

Hello Yuri ! After my last reply I followed the code again and found that it seems to already have a way to do it using src/proxy/proxy.h but I couldn't find a way to set our own proxy function/wrapper for it. Cheers ! On 9/8/20 20:04, Yuri wrote: For my problem Glpk quickly finds some