Hi John, You can read / download the paper "Proximity search heuristics for Mixed Integer Programs" here (http://www.dei.unipd.it/~fisch/papers/proxy_RAMP.pdf)
Proximity Search in GLPK solver was implemented by Giorgio Sartor. https://www.researchgate.net/profile/Giorgio_Sartor2 Noli On 3/1/16, ΤΑΣΣΟΠΟΥΛΟΣ ΙΩΑΝΝΗΣ <[email protected]> wrote: > Good evening, > I need to include the solutions that GLPK gives on some difficult problems > in a paper that I am about to publish. Due to the problems' difficulty I > used the --proxy option of GLPK in command prompt and thus GLPK managed to > find good solutions, although they are not optimal in all cases. As it is > obvious, I have to mention in the paper that I did not use a brute force > method with GLPK, since GLPK is unable to solve these problems that way. > Instead, I have to mention that when I use the option --proxy things got a > lot better. Nevertheless I have no idea about what the proxy heuristic is. > Could any one give a short description of proxy heuristic that could be > included in my paper? If someone is willing to do so, I would ask for a > short, exact and formal description, without too much technical details. > Thanks a lot for your time > Ioannis Tassopoulos > _______________________________________________ Help-glpk mailing list [email protected] https://lists.gnu.org/mailman/listinfo/help-glpk
