pkgsrc - [no description]

Age	Commit message (Collapse)	Author	Files	Lines
2005-03-30	Rev.1: use LIBTOOL and build a shared library	adam	6	-5/+127

2005-02-23	Add RMD160 digests in addition to SHA1 ones.	agc	1	-1/+2

2005-01-14	Changes 4.8:	adam	3	-7/+6
	Core simplex method and interior-point method routines were re-implemented and now they use a new, "storage-by-rows" sparse matrix format (unlike previous versions where linked lists were used to represent sparse matrices). For details see ChangeLog. Also a minor bug was fixed in API routine lpx_read_cpxlp.
2004-11-30	Changes 4.7:	adam	3	-17/+17
	Now GLPK supports free MPS format. Two new API routines lpx_read_freemps (to read problem data in free MPS format) and lpx_write_freemps (to write problem data in free MPS format) were added. This feature is also available in the solver glpsol via new command-line options --freemps and --wfreemps. For more details see the GLPK reference manual. API routines lpx_read_cpxlp and lpx_write_cpxlp for reading and writing problem data in CPLEX LP format were re-implemented to allow long symbolic names (up to 255 characters). The following three modules were temporarily removed from the GLPK distribution due to licensing problems: DELI (an interface module to Delphi), GLPKMEX (an interface module to Matlab), and JNI (an interface module to Java).
2003-07-21	COMMENT should start with a capital letter.	martti	1	-2/+2

2003-07-17	s/netbsd.org/NetBSD.org/	grant	1	-2/+2

2003-06-02	Use tech-pkg@ in favor of packages@ as MAINTAINER for orphaned packages.	jschauma	1	-2/+2
	Should anybody feel like they could be the maintainer for any of thewe packages, please adjust.
2002-07-02	Add RCS Id.	wiz	1	-0/+1

2002-06-26	import of glpk-3.0.7 provided in PR pkg/16691 by Kent Polk ↵	dmcmahill	4	-0/+62
	<kent@tiamat.goathill.org> with some changes and finishing of the package by me. GLPK is a set of routines written in ANSI C and organized in the form of a callable library. This package is intended for solving large-scale linear programming (LP), mixed integer linear programming (MIP), and other related problems. GLPK includes the following main components: * implementation of the primal/dual simplex method; * implementation of the primal-dual interior point method; * implementation of the branch-and-bound procedure (based on the dual simplex method); * application program interface (API); * GLPK/L, a modeling language intended for writing LP/MIP models; * GLPSOL, a stand-alone program intended for solving LP/MIP problems either prepared in the MPS format or written in the GLPK/L modeling language.