| Event | PB'09 competition |
| Type | PB |
| Submitter | Olivier Bailleux |
| Date of submission | 2009-04-26 15:52 |
| Name | BoolVar |
| Version | 2009-04-26 |
| Authors | Olivier BAILLEUX |
| Complete/Incomplete | Complete |
| Is able to solve | DEC-BIGINT-LIN DEC-BIGINT-NLC DEC-SMALLINT-LIN DEC-SMALLINT-NLC PURE-SAT |
| Solver command line | java -Xmx1500m -jar pb2cnfsolver.jar 6 BENCHNAME minisat %dimacs %var |
| Conversion script command line | PBconversionToLinear BENCHNAME |
| Comments | |
| Solver files and checksums |
| Event | PB'09 competition |
| Type | PB |
| Submitter | Vasco Manquinho |
| Date of submission | 2009-06-15 19:33 |
| Name | bsolo |
| Version | 3.1 |
| Authors | Vasco Manquinho and José Santos |
| Complete/Incomplete | Complete |
| Is able to solve | DEC-SMALLINT-LIN DEC-SMALLINT-NLC OPT-SMALLINT-LIN OPT-SMALLINT-NLC PURE-SAT |
| Solver command line | bsolo -l2 -tTIMEOUT -mMEMLIMIT BENCHNAME |
| Conversion script command line | PBconversionToLinear BENCHNAME |
| Comments | Cardinality Constraint Learning |
| Solver files and checksums |
| Event | PB'09 competition |
| Type | PB |
| Submitter | Vasco Manquinho |
| Date of submission | 2009-06-15 19:34 |
| Name | bsolo |
| Version | 3.1 cl |
| Authors | Vasco Manquinho and José Santos |
| Complete/Incomplete | Complete |
| Is able to solve | DEC-SMALLINT-LIN DEC-SMALLINT-NLC OPT-SMALLINT-LIN OPT-SMALLINT-NLC PURE-SAT |
| Solver command line | bsolo -l1 -tTIMEOUT -mMEMLIMIT BENCHNAME |
| Conversion script command line | PBconversionToLinear BENCHNAME |
| Comments | Clause Learning |
| Solver files and checksums |
| Event | PB'09 competition |
| Type | PB |
| Submitter | Vasco Manquinho |
| Date of submission | 2009-06-15 19:40 |
| Name | bsolo |
| Version | 3.1 pb |
| Authors | Vasco Manquinho and José Santos |
| Complete/Incomplete | Complete |
| Is able to solve | DEC-SMALLINT-LIN DEC-SMALLINT-NLC OPT-SMALLINT-LIN OPT-SMALLINT-NLC PURE-SAT |
| Solver command line | bsolo -l3 -tTIMEOUT -mMEMLIMIT BENCHNAME |
| Conversion script command line | PBconversionToLinear BENCHNAME |
| Comments | Pseudo-Boolean constraint learning (optional submission) |
| Solver files and checksums |
| Event | PB'09 competition |
| Type | PB |
| Submitter | Benjamin Kaufmann |
| Date of submission | 2009-04-24 15:52 |
| Name | pbclasp |
| Version | 2009-04-24 |
| Authors | Benjamin Kaufmann |
| Complete/Incomplete | Complete |
| Is able to solve | DEC-SMALLINT-LIN DEC-SMALLINT-NLC OPT-SMALLINT-LIN OPT-SMALLINT-NLC PURE-SAT |
| Solver command line | perl HOME/pbclasp BENCHNAME HOME TMPDIR |
| Conversion script command line | PBconversionToLinear BENCHNAME |
| Comments | see readme file |
| Solver files and checksums |
| Event | PB'09 competition |
| Type | PB |
| Submitter | Daniel Le Berre |
| Date of submission | 2009-06-12 10:08 |
| Name | SAT4J Pseudo CP |
| Version | 2.1.1 |
| Authors | Daniel Le Berre and Anne Parrain |
| Complete/Incomplete | Complete |
| Is able to solve | DEC-BIGINT-LIN DEC-BIGINT-NLC DEC-SMALLINT-LIN DEC-SMALLINT-NLC OPT-BIGINT-LIN OPT-BIGINT-NLC OPT-SMALLINT-LIN OPT-SMALLINT-NLC PURE-SAT |
| Solver command line | java6 -server -Xms1300m -Xmx1300m -jar HOME/org.sat4j.pb.jar CuttingPlanes BENCHNAME |
| Conversion script command line | |
| Comments | |
| Solver files and checksums |
| Event | PB'09 competition |
| Type | PB |
| Submitter | Daniel Le Berre |
| Date of submission | 2009-06-12 10:08 |
| Name | SAT4J Pseudo Resolution |
| Version | 2.1.1 |
| Authors | Daniel Le Berre and Anne Parrain |
| Complete/Incomplete | Complete |
| Is able to solve | DEC-BIGINT-LIN DEC-BIGINT-NLC DEC-SMALLINT-LIN DEC-SMALLINT-NLC OPT-BIGINT-LIN OPT-BIGINT-NLC OPT-SMALLINT-LIN OPT-SMALLINT-NLC PURE-SAT |
| Solver command line | java6 -server -Xms1300m -Xmx1300m -jar HOME/org.sat4j.pb.jar BENCHNAME |
| Conversion script command line | |
| Comments | Removed glucose learned clause memory management. |
| Solver files and checksums |
| Event | PB'09 competition |
| Type | PB |
| Submitter | Stefan Heinz |
| Date of submission | 2009-04-25 21:11 |
| Name | SCIPclp |
| Version | SCIP 1.1.0.7 with CLP 1.8.2 |
| Authors | Timo Berthold, Stefan Heinz, Marc Pfetsch, and Michael Winkler |
| Complete/Incomplete | Complete |
| Is able to solve | DEC-SMALLINT-LIN DEC-SMALLINT-NLC OPT-SMALLINT-LIN OPT-SMALLINT-NLC PURE-SAT |
| Solver command line | HOME/pbscip.linux.x86_64.gnu.opt-gcc42.clp -t TIMEOUT -m MEMLIMIT -f BENCHNAME |
| Conversion script command line | |
| Comments | http://scip.zib.de |
| Solver files and checksums |
| Event | PB'09 competition |
| Type | PB |
| Submitter | Stefan Heinz |
| Date of submission | 2009-04-25 21:21 |
| Name | SCIPspx |
| Version | SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009) |
| Authors | Timo Berthold, Stefan Heinz, Marc Pfetsch, and Michael Winkler |
| Complete/Incomplete | Complete |
| Is able to solve | DEC-SMALLINT-LIN DEC-SMALLINT-NLC OPT-SMALLINT-LIN OPT-SMALLINT-NLC PURE-SAT |
| Solver command line | HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t TIMEOUT -m MEMLIMIT -f BENCHNAME |
| Conversion script command line | |
| Comments | http://scip.zib.de |
| Solver files and checksums |
| Event | PB'09 competition |
| Type | PB |
| Submitter | Vasco Manquinho |
| Date of submission | 2009-06-15 19:29 |
| Name | wbo |
| Version | 1.0 |
| Authors | Vasco Manquinho |
| Complete/Incomplete | Complete |
| Is able to solve | DEC-SMALLINT-LIN DEC-SMALLINT-NLC OPT-SMALLINT-LIN OPT-SMALLINT-NLC PURE-SAT |
| Solver command line | wbo -file-format=opb -time-limit=TIMEOUT BENCHNAME |
| Conversion script command line | PBconversionToLinear BENCHNAME |
| Comments | In optimization instances, the solver only outputs an 'o' line when the optimum value is found, since it works with lower bounds instead of the classical upper bound approach on the best solution. |
| Solver files and checksums |