[Help-glpk] Multiple solutions for a binary MIP problem?

[Pavel Klinov]

Hello,

I wonder if glpk can provide me with several optimal solutions for a
0-1 IP instance (seems not, but I thought I'd ask). I assume I could
use glpk as an oracle that only returns one solution and simply search
around (as suggested in, e.g., [1]), but a more direct way would be
super useful.

Any advice will be very appreciated, thanks.

Pavel

-- 
cheers,
--pavel
http://www.cs.man.ac.uk/~klinovp

[1] Emilie Danna and David L. Woodruff, "How to select a small set of
diverse solutions to mixed integer programming problems".