21 const int heurswitchround,
22 const bool do_edge_switch_heur,
23 const int struct_switch_heur);
43 const int struct_ind,
const int maxiter);
double structure_switch_improve(const MC_problem &mc, const int struct_ind, const int maxiter)
double edge_switch_improve(const MC_problem &mc, const int maxiter)
This class is a very simple impelementation of a constant length string.
MC_solution & operator=(const MC_solution &sol)
double compute_cost(const int m, const MC_graph_edge *edges)
virtual double objective_value() const
The method returning the objective value of the solution.
double switch_improve(const MC_problem &mc, const int maxiter)
BCP_buffer & unpack(BCP_buffer &buf)
This class describes the message buffer used for all processes of BCP.
double ising_with_external_edge_switch_improve(const MC_problem &mc, const int maxiter)
double lk_switch_improve(const MC_problem &mc, const int maxiter)
void fint fint fint fint fint fint fint fint fint fint real real real real real real real real real fint real fint real char real fint fint * maxiter
void display(const BCP_string &fname) const
BCP_buffer & pack(BCP_buffer &buf) const
This is the abstract base class for a solution to a Mixed Integer Programming problem.