File: control

package info (click to toggle)
minisat+ 1.0-4
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, buster, sid
  • size: 600 kB
  • ctags: 1,322
  • sloc: cpp: 6,535; makefile: 74; sh: 23
file content (23 lines) | stat: -rw-r--r-- 1,108 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
Source: minisat+
Section: science
Priority: extra
Maintainer: Debian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
Uploaders: Ralf Treinen <treinen@debian.org>
Build-Depends: debhelper (>= 10), libgmp-dev, zlib1g-dev
Standards-Version: 3.9.8
Homepage: http://minisat.se/MiniSat+.html
Vcs-Git: https://anonscm.debian.org/git/debian-science/packages/minisat+.git
Vcs-Browser: https://anonscm.debian.org/cgit/debian-science/packages/minisat+.git

Package: minisat+
Architecture: any
Depends: ${misc:Depends}, ${shlibs:Depends}
Description: solver for pseudo-Boolean constraints
 MinSat+ is a solver for Pseudo-Boolean Optimization (AKA 0-1
 integer programming) that is based on the MiniSat SAT-solver. It
 supports optimizing a linear objective function, subject to a set
 of linear constraints. The variables of the objective function
 and constraints are boolean, i.e. required to be 0 or
 1. Pseudo-Boolean optimization can be used to solve many kinds of
 combinatorial optimization problems. This version of Minisat+ is
 compiled with bignum support for constraint coefficients.