[Top][All Lists]

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

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

From: Andrew Makhorin
Subject: Re: [Help-glpk] hybrid pseudo-cost branching
Date: Sat, 16 Jun 2012 12:20:02 +0400

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

reply via email to

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