gatom_example

<p>The graph is based on <code>gatom</code> package</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 

gatom_example function

<p>An object of class <code>igraph</code> of length 194.</p>

Format

Example of graph from which an SGMWCS instance can be obtained — gatom_example

Example of graph from which an SGMWCS instance can be obtained

gatom_example: Example of graph from which an SGMWCS instance can be obtained

Description

Usage

Arguments

Format