#include <cmath>#include <algorithm>#include "CoinSort.hpp"#include "BCP_vector.hpp"#include "BCP_matrix.hpp"#include "MC_cut.hpp"#include "MC_solution.hpp"#include "MC.hpp"
Include dependency graph for MC_cutgen.cpp:
Go to the source code of this file.
Functions | |
| void | MC_cuts_from_mst (const MC_problem &mc, const double *x, const double minviol, const BCP_vec< int > &nodesign, const BCP_vec< int > &parentnode, const BCP_vec< int > &parentedge, const int maxnewcuts, BCP_vec< BCP_cut * > &new_cuts, BCP_vec< BCP_row * > &new_rows) |
| MC_solution * | MC_mst_cutgen (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, const double minviol, const int maxnewcuts, BCP_vec< BCP_cut * > &new_cuts, BCP_vec< BCP_row * > &new_rows) |
Function Documentation
| void MC_cuts_from_mst | ( | const MC_problem & | mc, |
| const double * | x, | ||
| const double | minviol, | ||
| const BCP_vec< int > & | nodesign, | ||
| const BCP_vec< int > & | parentnode, | ||
| const BCP_vec< int > & | parentedge, | ||
| const int | maxnewcuts, | ||
| BCP_vec< BCP_cut * > & | new_cuts, | ||
| BCP_vec< BCP_row * > & | new_rows | ||
| ) |
Definition at line 17 of file MC_cutgen.cpp.
| MC_solution* MC_mst_cutgen | ( | 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, | ||
| const double | minviol, | ||
| const int | maxnewcuts, | ||
| BCP_vec< BCP_cut * > & | new_cuts, | ||
| BCP_vec< BCP_row * > & | new_rows | ||
| ) |
Definition at line 152 of file MC_cutgen.cpp.
