cddlib.jl-3391f64e-dcde-5f30-b752-e11513730f60

Last snapshots taken from https://github.com/UnofficialJuliaMirror/CDDLib.jl-3391f64e-dcde-5f30-b752-e11513730f60 on 2019-11-20T05:31:09.986-05:00 by @UnofficialJuliaMirrorBot via Travis job 153.10 , triggered by Travis cron job on branch "master"

https://github.com/unofficialjuliamirrorsnapshots/cddlib.jl-3391f64e-dcde-5f30-b752-e11513730f60

Science Score: 41.0%

This score indicates how likely this project is to be science-related based on various indicators:

✓
CITATION.cff file
Found CITATION.cff file
○
codemeta.json file
○
.zenodo.json file
✓
DOI references
Found 3 DOI reference(s) in README
✓
Academic publication links
Links to: zenodo.org
○
Academic email domains
○
Institutional organization owner
○
JOSS paper metadata
○
Scientific vocabulary similarity
Low similarity (10.6%) to scientific vocabulary

Last synced: 6 months ago · JSON representation ·

Repository

Basic Info

Host: GitHub
Owner: UnofficialJuliaMirrorSnapshots
License: other
Language: Julia
Default Branch: master
Size: 59.6 KB

Statistics

Stars: 0
Watchers: 1
Forks: 0
Open Issues: 0
Releases: 0

Created almost 7 years ago · Last pushed over 6 years ago

Metadata Files

Readme License Citation

README.md

CDDLib

| Build Status | References to cite | |:----------------:|:----------------------:| | | | | | |

CDDLib is a wrapper for cdd. This module can either be used in a "lower level" using the API of cdd or using the higher level interface of Polyhedra. CDDLib also includes the linear programming solver CDDLib.Optimizer which can be used by JuMP through MathOptInterface.

Building the package will download binaries of cddlib that are compiled by cddlibBuilder.

As written in the README of cddlib:

The C-library cddlib is a C implementation of the Double Description Method of Motzkin et al. for generating all vertices (i.e. extreme points) and extreme rays of a general convex polyhedron in R^d given by a system of linear inequalities:

P = { x=(x1, ..., xd)^T : b - A x >= 0 }

where A is a given m x d real matrix, b is a given m-vector and 0 is the m-vector of all zeros.

The program can be used for the reverse operation (i.e. convex hull computation). This means that one can move back and forth between an inequality representation and a generator (i.e. vertex and ray) representation of a polyhedron with cdd. Also, cdd can solve a linear programming problem, i.e. a problem of maximizing and minimizing a linear function over P.

Owner

Name: Unofficial Julia Mirror [Snapshots]
Login: UnofficialJuliaMirrorSnapshots
Kind: organization

Website: https://github.com/UnofficialJuliaMirrorSnapshots/RepoSnapshots.jl
Repositories: 4
Profile: https://github.com/UnofficialJuliaMirrorSnapshots

Snapshots of all registered Julia packages. Updated weekly by @UnofficialJuliaMirrorBot. See also: @UnofficialJuliaMirror.

Citation (CITATION.bib)

@misc{CDDLib.jl,
  author       = {Benoît Legat and
                  Robin Deits and
                  Marcelo Forets and
                  Daisuke Oyama and
                  François Pacaud and
                  Elliot Saba},
  title        = {JuliaPolyhedra/CDDLib.jl},
  month        = may,
  year         = 2019,
  doi          = {10.5281/zenodo.1214581},
  url          = {https://doi.org/10.5281/zenodo.1214581}
}

ecosyste.ms

Data

Tools

Indexes

Applications

Experiments

Open Source Science