70 FILE * file = fopen(filename,
"r");
72 printf(
"Failure to open ufl datafile: %s\n ", filename);
76 while (fgets(s, 500, file)) {
77 const int len = strlen(s) - 1;
83 if (ss.find(
"fdata") == 0) {
85 int j1 = ss.length() - j + 1;
86 fdata = ss.substr(j+1, j1);
88 }
else if (ss.find(
"dualfile") == 0) {
90 int j1 = ss.length() - j + 1;
93 }
else if (ss.find(
"dual_savefile") == 0) {
95 int j1 = ss.length() - j + 1;
98 }
else if (ss.find(
"int_savefile") == 0) {
100 int j1 = ss.length() - j + 1;
103 }
else if (ss.find(
"h_iter") == 0) {
104 int i = ss.find(
"=");
std::string dual_savefile
UFL_parms(const char *filename)
int heuristics(const VOL_problem &p, const VOL_dvector &x, double &heur_val)
Starting from the primal vector x, run a heuristic to produce an integer solution
int solve_subproblem(const VOL_dvector &u, const VOL_dvector &rc, double &lcost, VOL_dvector &x, VOL_dvector &v, double &pcost)
Solve the subproblem for the subgradient step.
int compute_rc(const VOL_dvector &u, VOL_dvector &rc)
compute reduced costs
This class holds every data for the Volume Algorithm and its solve method must be invoked to solve th...
The user hooks should be overridden by the user to provide the problem specific routines for the volu...