gam_example

<p>A dataset containing some real-world instances appeared in network
enrichment analysis tool Shiny GAM
(tools:::Rd_expr_doi("10.1093/nar/gkw266")).</p>

datasets

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.

Alexander Loboda

mwcsr

Solvers for Maximum Weight Connected Subgraph Problem and Its
Variants

Nikolay Poperechnyi

Eduardo Alvarez-Miranda

Markus Sinnl

Alexey Sergushichev

Paul Hosler Jr.

www.hamcrest.org 

Barak Naveh and Contributors 

The Apache Software Foundation 

gam_example function

<p>A vector of named vertex-weighted igraph instances</p>

Format

GAM instance for MWCS problem — gam_example

GAM instance for MWCS problem

gam_example: GAM instance for MWCS problem

Description

Usage

Arguments

Format