ccnpk.lp: ccnpk.lp
In beanumber/compgraph: Library for Composite Graphs

Compute the optimal solution to the CCNP-k problem using LP relaxation

1	ccnpk.lp(ccg, ...)

`ccg`	a ccgraph object
`...`	Arguments to be passed to compgraph

A linear program

The optimal fractional solution

Ben Baumer

n = 20
p = 1/2
ccg = ccg.game(n, p)
ccnpk.lp(ccg)

beanumber/compgraph documentation built on May 12, 2019, 9:42 a.m.

beanumber/compgraph index

README.md

Note that we can't provide technical support on individual packages. You should contact the package authors for that.

Description