[Top][All Lists]

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

Re: [Help-glpk] hybrid pseudo-cost branching

From: Meketon, Marc
Subject: Re: [Help-glpk] hybrid pseudo-cost branching
Date: Sat, 16 Jun 2012 06:54:49 -0500

Thank you!

This paper also discusses "history branching" - any plans for implementing that?

-----Original Message-----
From: Andrew Makhorin [mailto:address@hidden
Sent: Saturday, June 16, 2012 4:20 AM
To: Meketon, Marc
Cc: address@hidden
Subject: Re: [Help-glpk] hybrid pseudo-cost branching

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

Please see the following paper:

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]