• CFSQP

  • Referenced in 61 articles [sw04658]
  • Constrained Nonlinear (Minimax) Optimization Problems, Generating Iterates Satisfying All Inequality Constraints. CFSQP ... functions for the minimization of the maximum of a set of smooth objective functions (possibly ... successive iterates generated by CFSQP all satisfy these constraints. Nonlinear equality constraints are turned into ... inequality constraints (to be satisfied by all iterates) and the maximum of the objective functions...
  • CCLS

  • Referenced in 14 articles [sw36049]
  • Efficient Local Search Algorithm for Weighted Maximum Satisfiability. The maximum satisfiability (MAX-SAT) problem, especially...
  • MaxSolver

  • Referenced in 20 articles [sw01990]
  • Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which ... variable assignment is sought to satisfy the maximum number of clauses in a Boolean formula...
  • HyFlex

  • Referenced in 11 articles [sw07688]
  • hard combinatorial problems are fully implemented: maximum satisfiability, one dimensional bin packing, permutation flow shop...
  • LMHS

  • Referenced in 8 articles [sw16738]
  • LMHS, an open-source weighted partial maximum satisfiability (MaxSAT) solver. LMHS is a hybrid...
  • CCEHC

  • Referenced in 3 articles [sw36050]
  • local search algorithm for weighted partial maximum satisfiability. Weighted maximum satisfiability and (unweighted) partial maximum ... significant generalizations of maximum satisfiability (MAX-SAT), and weighted partial maximum satisfiability (WPMS...
  • MSUnCore

  • Referenced in 3 articles [sw09733]
  • MSUnCore - Maximum Satisfiability with UNsatisfiable COREs. MSUnCore is a software system for solving (Weighted) (Partial ... Maximum Satisfiability (MaxSAT), and implements a number of different algorithms. Most of the MaxSAT algorithms...
  • SATLike

  • Referenced in 1 article [sw36041]
  • weighting, unit propagation and hybridization for maximum satisfiability. Maximum Satisfiability (MaxSAT) is a basic...
  • MaxPre

  • Referenced in 1 article [sw21952]
  • open-source preprocessor for (weighted partial) maximum satisfiability (MaxSAT). MaxPre implements both SAT-based...
  • RC2

  • Referenced in 1 article [sw36048]
  • algorithm for solving maximum satisfiability. RC2 stands for relaxable cardinality constraints (alternatively, soft cardinality constraints...
  • meboot

  • Referenced in 12 articles [sw10488]
  • Time Series: The meboot R Package. The maximum entropy bootstrap is an algorithm that creates ... Stationarity is not required and the ensemble satisfies the ergodic theorem and the central limit...
  • HeerHugo

  • Referenced in 18 articles [sw09704]
  • contradiction), p|(q->(abcd<->s)) (satisfiable). The input is put in a file ... options can be set, such as the maximum number of proposition letters (which has been...
  • CRCBode

  • Referenced in 1 article [sw10849]
  • performance criterion is satisfied. Nonlinearities are accounted for by avoiding the maximum forbidden regions over...
  • GPDOF

  • Referenced in 8 articles [sw02585]
  • input parameters. Recursive assembly methods (decomposition-recombination), maximum matching based algorithms, and other famous propagation ... buildings using interactively introduced geometrical constraints. Models satisfying the set of linear, bilinear and quadratic...
  • BBMCW

  • Referenced in 4 articles [sw21469]
  • paper describes BBMCW, a new efficient exact maximum clique algorithm tailored for large sparse graphs ... watched literal’ technique used in satisfiability and other constraint problems. The new encoding reduces...
  • SHRAD

  • Referenced in 6 articles [sw02663]
  • regarded as the standard setting to obtain maximum data abstraction. As for efficiency there ... framework for exact real number computation which satisfies the following all at the same time...
  • PuFFIN

  • Referenced in 2 articles [sw22390]
  • parameters according to their data (e.g., the maximum allowed nucleosome overlap or legal ranges ... function, PuFFIN produces a consensus set that satisfies non-overlapping constraints and maximizes the number...
  • CoCoA

  • Referenced in 631 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...
  • Coq

  • Referenced in 1807 articles [sw00161]
  • Coq is a formal proof management system. It...
  • CSDP

  • Referenced in 200 articles [sw00169]
  • CSDP, A C Library for Semidefinite Programming. This...