[Help-glpk] hybrid pseudo-cost branching

[Meketon, Marc]

 

I’ve been playing around with a “crew roster” algorithm, partly using the integer programming ability of GLPK.  Part of my “playing” is to try out different MIP options.

 

For a number of different problem sets, the “hybrid pseudo-cost heuristic branching” consistently seems to do the best.  Just to satisfy my curiosity, I tried to search in both the GLPK documentation and on the web to understand exactly what this branching heuristic does, but I’ve been unsuccessful.  I did find http://cpaior2011.zib.de/downloads/CPAIOR2011_masterclass_chinneck.pdf which discusses the concepts, but leaves a number of details out.

 

Does anyone have a link to a paper that describes the hybrid pseudo-cost heuristic?

 

-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.