gecode 3.7.3-1 source package in Ubuntu

Changelog

gecode (3.7.3-1) unstable; urgency=low


  * New upstream release (soname 32)

 -- Kari Pahula <email address hidden>  Sun, 01 Apr 2012 00:16:09 +0300

Upload details

Uploaded by:
Kari Pahula
Uploaded to:
Sid
Original maintainer:
Kari Pahula
Architectures:
any all
Section:
libs
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
gecode_3.7.3-1.dsc 1.4 KiB 7a566bd65c20b7423e85285af7fb8e7e0a47fa0c90529ec798601cbeae66509b
gecode_3.7.3.orig.tar.gz 1.6 MiB e7cc8bcc18b49195fef0544061bdd2e484a1240923e4e85fa39e8d6bb492854c
gecode_3.7.3-1.debian.tar.gz 10.9 KiB d563137c7e1434110c4bde1b024bca21777fc49a331d16b38160418f09a1f09a

Available diffs

No changes file available.

Binary packages built by this source

flatzinc: constraint problem modelling language

 FlatZinc is a low-level modelling language for constraint
 problems. It is designed to be easily interfaceable to constraint
 solvers (like Gecode). For more information on FlatZinc, please refer
 to the MiniZinc pages of the G12 project
 <http://www.g12.cs.mu.oz.au/minizinc/>.
 .
 We provide a parser that reads a FlatZinc model from a file, and
 returns a Gecode Space object that represents the model. We also
 provide a simple front-end, an executable program that reads a
 FlatZinc model and prints the solution (if any) on the standard
 output.
 .
 The FlatZinc interpreter that ships with Gecode version 4.2.0
 supports the FlatZinc language and MiniZinc global constraint
 definitions of MiniZinc version 1.6.0.

libgecode-dev: generic constraint development environment

 Gecode is a toolkit for developing constraint-based systems and
 applications. Gecode provides a constraint solver with
 state-of-the-art performance while being modular and extensible.
 .
 Gecode is radically open for programming: it can be easily
 interfaced to other systems. It supports the programming of new
 propagators (as implementation of constraints), branching strategies,
 and search engines. New variable domains can be programmed at the same
 level of efficiency as finite domain and integer set variables that
 come predefined with Gecode.

libgecode-doc: No summary available for libgecode-doc in ubuntu raring.

No description available for libgecode-doc in ubuntu raring.

libgecode32: No summary available for libgecode32 in ubuntu trusty.

No description available for libgecode32 in ubuntu trusty.

libgecodeflatzinc32: No summary available for libgecodeflatzinc32 in ubuntu quantal.

No description available for libgecodeflatzinc32 in ubuntu quantal.

libgecodegist32: No summary available for libgecodegist32 in ubuntu saucy.

No description available for libgecodegist32 in ubuntu saucy.