[Top][All Lists]

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

Re: [Help-glpk] order restrictions

From: robin hankin
Subject: Re: [Help-glpk] order restrictions
Date: Thu, 1 Nov 2012 22:14:48 +1300

Thanks for this, Xypron.

> MIP optimzers are not fast solvers for constraint programming problems.

That's a shame.
What would you suggest for solving a 10x10x10 binary array subject to ~200 restrictions?
It's not suitable for DLX.

Also, I suspect that  any insights I have into my problems will not improve on the T-D heuristic.

best wishes


To choose the variable glpsol uses the Tomlin-Driebeek heuristic by default, cf.


*  Tomlin J.A. Branch and bound methods for integer and non-convex
*  programming, in J.Abadie (ed.), Integer and Nonlinear Programming,
*  North-Holland, Amsterdam, pp. 437-50 (1970).

You can influence the branching variable if you use GLPK library and provide a callback function. See

Best regards


Robin Hankin
Uncertainty Analyst

reply via email to

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