/**
* Solves a linear ordering problem.
*
* @param inFile input file
* @param outFile output file
*/
private void solve(String inFile, String outFile)
{
glp_iocp iocp;
GlpkCallback.addListener(this);
read_data(inFile);
build_mip();
GLPK.glp_adv_basis(prob, 0);
GLPK.glp_simplex(prob, null);
iocp = new glp_iocp();
GLPK.glp_init_iocp(iocp);
GLPK.glp_intopt(prob, iocp);
GLPK.glp_print_mip(prob, outFile);
GlpkCallback.removeListener(this);
GLPK.glp_delete_prob(prob);
}
/// <summary>
/// Résout le problème
/// </summary>
/// <returns>Borne inférieure</returns>
private double _solve()
{
GLPK.glp_term_out(GLPK.GLP_OFF);
glp_iocp iocp;
GlpkCallback.addListener(this);
buildProblem(); //On construit le problème
GLPK.glp_adv_basis(problem, 0);
GLPK.glp_simplex(problem, null); //On résout
double val = GLPK.glp_get_obj_val(problem);
iocp = new glp_iocp();
GLPK.glp_init_iocp(iocp);
GLPK.glp_intopt(problem, iocp); //On cherche la solution entière optimale
GlpkCallback.removeListener(this);
GLPK.glp_delete_prob(problem);
return(GLPK.glp_get_obj_val(problem));
}
private Route _solve()
{
glp_iocp iocp;
GlpkCallback.addListener(this);
buildProblem();
GLPK.glp_adv_basis(problem, 0);
GLPK.glp_simplex(problem, null);
iocp = new glp_iocp();
GLPK.glp_init_iocp(iocp);
GLPK.glp_intopt(problem, iocp);
List <Route> res = getSubroutes(true);
GlpkCallback.removeListener(this);
GLPK.glp_delete_prob(problem);
return(res[0]);
}
private double _solve()
{
GLPK.glp_term_out(GLPK.GLP_OFF);
GlpkCallback.addListener(this);
buildProblem();
GLPK.glp_adv_basis(problem, 0);
GLPK.glp_simplex(problem, null);
double val = GLPK.glp_get_obj_val(problem);
/*iocp = new glp_iocp();
* GLPK.glp_init_iocp(iocp);
* GLPK.glp_intopt(problem, iocp);*/
List <Route> res = getSubroutes(true);
GlpkCallback.removeListener(this);
GLPK.glp_delete_prob(problem);
return(GLPK.glp_get_obj_val(problem));
}
