Solvers for Maximum Weight Connected Subgraph Problem and Its Variants
Construct an annealing solver
Check the type and the validity of an MWCS instance
Calculate weight of the solution. MWCS, GMWCS and SGMWCS instances are...
Helper function to convert an igraph object into a proper SGMWCS ins...
The method returns all parameters supported by specific solver
Generate a rmwcs solver
Construct relax-and-cut SGMWCS solver
Construct a SCIP-jack solver
Sets values of specific parameters
Solves a MWCS instance.
Sets time limitation for a solver
Construct a virgo solver
Algorithms for solving various Maximum Weight Connected Subgraph Problems, including variants with budget constraints, cardinality constraints, weighted edges and signals. The package represents an R interface to high-efficient solvers based on relax-and-cut approach (Álvarez-Miranda E., Sinnl M. (2017) <doi:10.1016/j.cor.2017.05.015>) mixed-integer programming (Loboda A., Artyomov M., and Sergushichev A. (2016) <doi:10.1007/978-3-319-43681-4_17>) and simulated annealing.