871ed5c997
A new, more efficient implementation of the dual simplex method was included in the package. This new implementation replaces the old one, which was removed. Option sr_heur was added to struct glp_iocp to enable/disable the simple rounding heuristic used by the MIP solver. New API routine glp_at_error was added and documented. Some minor typos were corrected in the GLPK documentation. An example application program TSPSOL was added. It uses the GLPK MIP optimizer to solve the Symmetric Traveling Salesman Problem and illustrates "lazy" constraints generation. For more details please see glpk/examples/tsp/README.
20 lines
516 B
Makefile
20 lines
516 B
Makefile
# $NetBSD: Makefile,v 1.42 2015/11/27 21:00:28 adam Exp $
|
|
|
|
DISTNAME= glpk-4.57
|
|
CATEGORIES= math
|
|
MASTER_SITES= ${MASTER_SITE_GNU:=glpk/}
|
|
|
|
MAINTAINER= adam@NetBSD.org
|
|
HOMEPAGE= http://www.gnu.org/software/glpk/glpk.html
|
|
COMMENT= Library for solving linear programming problems
|
|
LICENSE= gnu-gpl-v3
|
|
|
|
USE_LIBTOOL= yes
|
|
USE_TOOLS+= gmake
|
|
GNU_CONFIGURE= yes
|
|
CONFIGURE_ARGS+= --with-gmp
|
|
TEST_TARGET= check
|
|
|
|
.include "../../devel/gmp/buildlink3.mk"
|
|
.include "../../devel/zlib/buildlink3.mk"
|
|
.include "../../mk/bsd.pkg.mk"
|