pkgsrc/math/glpk/distinfo

$NetBSD: distinfo,v 1.36 2015/11/27 21:00:28 adam Exp $

SHA1 (glpk-4.57.tar.gz) = d2df2de59798c35024df8d140a53453e29a095be
RMD160 (glpk-4.57.tar.gz) = 10cbe9f5c681d5893739cde1fd9d8c16cf468c73
SHA512 (glpk-4.57.tar.gz) = 1979e59b96ce359168a81b720207045916f66c5755023b02c2e197e5a713d456165d94f1e40830547dc072de865f94e3b3a4d8e66d5d15aeb93f304f1893fe48
Size (glpk-4.57.tar.gz) = 3782998 bytes
SHA1 (patch-src_Makefile.in) = 277e8df4b63147b8bd9c637589df1491d2fa5189
Changes 4.57: 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. 2015-11-27 22:00:28 +01:00			$NetBSD: distinfo,v 1.36 2015/11/27 21:00:28 adam Exp $
import of glpk-3.0.7 provided in PR pkg/16691 by Kent Polk <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. 2002-06-26 17:30:39 +02:00
Changes 4.57: 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. 2015-11-27 22:00:28 +01:00			`SHA1 (glpk-4.57.tar.gz) = d2df2de59798c35024df8d140a53453e29a095be`
			`RMD160 (glpk-4.57.tar.gz) = 10cbe9f5c681d5893739cde1fd9d8c16cf468c73`
			`SHA512 (glpk-4.57.tar.gz) = 1979e59b96ce359168a81b720207045916f66c5755023b02c2e197e5a713d456165d94f1e40830547dc072de865f94e3b3a4d8e66d5d15aeb93f304f1893fe48`
			`Size (glpk-4.57.tar.gz) = 3782998 bytes`
			`SHA1 (patch-src_Makefile.in) = 277e8df4b63147b8bd9c637589df1491d2fa5189`