/home/coin/SVN-release/OS-2.4.2/Bcp/examples/MaxCut/Member/MC_mst_heur.cpp File Reference

#include "CoinHelperFunctions.hpp"
#include "CoinSort.hpp"
#include "BCP_vector.hpp"
#include "MC.hpp"
#include "MC_cut.hpp"
#include "MC_solution.hpp"

Include dependency graph for MC_mst_heur.cpp:

Go to the source code of this file.

Functions

MC_solutionMC_mst_heur (const MC_problem &mc, const double *x, const double *w, const double alpha, const double beta, const MC_EdgeOrdering edge_ordering, const int heurswitchround, const bool do_edge_switch_heur, const int struct_switch_heur)


Function Documentation

MC_solution* MC_mst_heur ( const MC_problem mc,
const double *  x,
const double *  w,
const double  alpha,
const double  beta,
const MC_EdgeOrdering  edge_ordering,
const int  heurswitchround,
const bool  do_edge_switch_heur,
const int  struct_switch_heur 
)

Definition at line 13 of file MC_mst_heur.cpp.

References BCP_vec< T >::begin(), m, MC_kruskal(), MC_MstEdgeOrderingPreferExtreme, MC_MstEdgeOrderingPreferOne, MC_MstEdgeOrderingPreferZero, n, MC_problem::num_edges, and MC_problem::num_nodes.

Referenced by MC_lp::mc_generate_heuristic_solution().


Generated on Wed Nov 30 03:04:41 2011 by  doxygen 1.4.7