New port: math/creme: Randomized thermal relaxation method for MaxFS problems

This commit is contained in:
Yuri Victorovich 2021-05-14 00:55:16 -07:00
parent fd036e9a4a
commit 0a733dd7d7
5 changed files with 55 additions and 0 deletions

View file

@ -216,6 +216,7 @@
SUBDIR += couenne
SUBDIR += coxeter3
SUBDIR += cppad
SUBDIR += creme
SUBDIR += crlibm
SUBDIR += cryptominisat
SUBDIR += csdp

25
math/creme/Makefile Normal file
View file

@ -0,0 +1,25 @@
PORTNAME= creme
DISTVERSION= g20210114
CATEGORIES= math
PKGNAMEPREFIX= coin-or-
MAINTAINER= yuri@FreeBSD.org
COMMENT= Randomized thermal relaxation method for MaxFS problems
LICENSE= EPL
USES= compiler:c++11-lang gmake libtool
USE_LDCONFIG= yes
USE_GITHUB= yes
GH_ACCOUNT= coin-or
GH_PROJECT= Creme
GH_TAGNAME= ab42f19
GNU_CONFIGURE= yes
INSTALL_TARGET= install-strip
TEST_TARGET= test
.include <bsd.port.mk>

3
math/creme/distinfo Normal file
View file

@ -0,0 +1,3 @@
TIMESTAMP = 1620974340
SHA256 (coin-or-Creme-g20210114-ab42f19_GH0.tar.gz) = 48ab55638c07a8bc6f5959e1e7f4c48b77e6a59322a3699ed7464a71ac586a88
SIZE (coin-or-Creme-g20210114-ab42f19_GH0.tar.gz) = 3256085

10
math/creme/pkg-descr Normal file
View file

@ -0,0 +1,10 @@
Creme is an implementation of the randomized thermal relaxation method to find
a feasible solution of the Maximum Feasible Subsystem (MaxFS) problem. The MaxFS
problem consists, given a Linear Programming problem
A x <= b,
generally infeasible, in finding a feasible subsystem containing a maximum
number of inequalities.
WWW: https://github.com/coin-or/Creme

16
math/creme/pkg-plist Normal file
View file

@ -0,0 +1,16 @@
bin/creme
include/coin/chooseblock.h
include/coin/cmdline.h
include/coin/init.h
include/coin/isfeas.h
include/coin/linopt.h
include/coin/locsrch.h
include/coin/lpio.h
include/coin/misc.h
include/coin/move.h
include/coin/rtr.h
include/coin/sparse.h
lib/libCreme.so
lib/libCreme.so.0
lib/libCreme.so.0.0.0
libdata/pkgconfig/creme.pc