rnc_solver: Construct relax-and-cut SGMWCS solver

View source: R/rnc_sgmwcs.R

rnc_solverR Documentation

Construct relax-and-cut SGMWCS solver

Description

The solver is based on the same approach as rmwcs solver. Modifications to the original scheme are introduced to tackle problems arising with introduction of edge weights and signals. It is recommended to use rmwcs solver to solve MWCS problems, while due to differences in primal heuristic it may be a good pratice to run both solvers on the same problem.

Usage

rnc_solver(
  max_iterations = 1000L,
  beta_iterations = 50L,
  heur_iterations = 10L,
  sep_iterations = 10L,
  verbose = FALSE
)

Arguments

max_iterations

Maximum number of iterations

beta_iterations

Number of nonimproving iterations until beta is halved

heur_iterations

Frequency of calling heuristic method (in iterations)

sep_iterations

Frequency of separating cuts (in iterations)

verbose

Should the solving progress and stats be printed?

Value

An object of class mwcs_solver

See Also

rmwcs_solver


mwcsr documentation built on July 13, 2022, 1:05 a.m.