[Help-glpk] Help regarding MILP problem

[gaurav khanna]

Hi all,

I have a 0-1 MIP formulation of a file scheduling problem. The variables
are all 0-1. When I run it using standard approach (as a MIP problem)
using glpsol on the command line, it runs for a long time. I am trying to
reduce the runtime of the problem to a few secs even if I have to
compromise accuracy to some extent. One way to do it is to solve the LP
relaxation first and then iteratively get the MIP solution. Does GLPK have
support to facilitate the solving of MIP problems by first letting them
solve for LP and then refine it? Or are there other ways to attain faster
solver time ?

I have attached the problem file in CPLEX LP format.

Regards
Gaurav

Gaurav Khanna
Phd Student
CSE Department,OSU

Phone (office):614-292-7036

problem_data.lpt
Description: Text document