• COMET

  • Referenced in 80 articles [sw03051]
  • Constraint-Based Local Search. The ubiquity of combinatorial optimization problems in our society is illustrated ... tournament scheduling. Over the last two decades, constraint programming has emerged as a fundamental methodology ... modeling and search components of constraint-based local search and describes how constraint-based local ... problems, illustrating the ability of constraint-based local search approaches to cope with both satisfiability...
  • CALMA

  • Referenced in 106 articles [sw03235]
  • participants developed optimization algorithms based on branch-and-cut and constraint satisfaction, and approximation techniques ... including a variety of local search methods, genetic algorithms, neural networks, and potential reduction. These...
  • CONOPT

  • Referenced in 170 articles [sw02791]
  • large-scale nonlinear programs involving sparse nonlinear constraints. The paper will discuss strategic and tactical ... algorithm with the popular methods based on sequential linearized subproblems forms the basis for discussions ... components in a GRG code: basis factorizations, search directions, line-searches, and Newton iterations ... with comparative figures for MINOS version 5.3. Based on these statistics the paper concludes that...
  • INTOPT_90

  • Referenced in 306 articles [sw04705]
  • global search: continuous problems The monograph gives a survey of interval arithmetic based methods ... admits equality constraints (within a box frame). The solution procedures are based on branch ... some new results with respect to zero search. The final chapter about intermediate values...
  • Gecode

  • Referenced in 82 articles [sw06272]
  • developing constraint-based systems and applications. Gecode provides a constraint solver with state ... supports the programming of new constraints, branching strategies, and search engines. New variable domains ... parts including reference documentation, implementations of global constraints, and examples are available as source code ... commodity hardware for parallel search, giving an already efficient base system an additional edge. tested...
  • OscaR

  • Referenced in 17 articles [sw09908]
  • available in OscaR are: Constraint Programming; Constrained Based Local Search; Linear (Integer) Programming; Discrete Event...
  • bnlearn

  • Referenced in 77 articles [sw08265]
  • learning and inference. This package implements constraint-based (GS, IAMB, Inter-IAMB, Fast-IAMB, MMPC ... Chow-Liu), score-based (Hill-Climbing and Tabu Search) and hybrid (MMHC and RSMAX2) structure...
  • CFSQP

  • Referenced in 61 articles [sw04658]
  • line search). He/She must provide functions that define the objective functions and constraint functions ... CFSQP is an implementation of two algorithms based on Sequential Quadratic Programming (SQP), modified ... first one (monotone line search), a certain Armijo type arc search is used with ... nonmonotone” search along a straight line. The merit function used in both searches...
  • PSwarm

  • Referenced in 68 articles [sw00742]
  • optional) search step of coordinate search, the algorithm incorporates a particle swarm scheme for dissemination ... highly competitive with other global optimization methods based only on function values. PSwarm is extended ... this paper to handle general linear constraints. The poll step now incorporates positive generators ... approximated active constraints, including a provision for the degenerate case. The search step has also...
  • GLOB

  • Referenced in 37 articles [sw00357]
  • based software for global optimization We describe an application of Variable Neighbourhood Search (VNS) methodology ... continuous global optimization problems with box constraints. A general VNS algorithm is implemented within...
  • Kangaroo

  • Referenced in 3 articles [sw13503]
  • Kangaroo: An Efficient Constraint-Based Local Search System Using Lazy Propagation. In this paper ... introduce Kangaroo, a constraint-based local search system. While existing systems such as Comet maintain...
  • OFMC

  • Referenced in 28 articles [sw09466]
  • integration of a number of symbolic, constraint-based techniques, which are correct and terminating ... intruder, and constraint differentiation, which is a general search-reduction technique that integrates the lazy ... sketch the ongoing integration of fixed-point-based techniques for protocol verification for an unbounded...
  • RealPaver

  • Referenced in 51 articles [sw04401]
  • Solving methods: Realpaver implements correctly rounded interval-based computations in a branch-and-bound framework ... from various fields: interval fixed-point operators, constraint propagation and local consistency techniques, local optimization ... using descent methods and metaheuristics, and several search strategies. Package: Realpaver is open source, configurable...
  • FloPSy

  • Referenced in 3 articles [sw12793]
  • FloPSy - search-based floating point constraint solving for symbolic execution. Recently there has been ... upsurge of interest in both, SearchBased Software Testing (SBST), and Dynamic Symbolic Execution...
  • RAMP

  • Referenced in 10 articles [sw02493]
  • adaptive memory programming, as expressed in tabu search. The extended PD-RAMP method ... based on Lagrangean and surrogate constraint relaxation on the dual side and on scatter search ... such as genetic algorithms and other procedures based on metaphors of nature...
  • SBSAT

  • Referenced in 10 articles [sw00828]
  • SBSAT: a state-based, BDD-based satisfiability solver We present a new approach ... solvers, supporting efficient implementation of highly sophisticated search heuristics over a range of propositional inputs ... formulas, but particularly sets of arbitrary boolean constraints, represented as BDDs. The approach preprocesses ... inferences based upon any single input constraint. It also simplifies the set of constraints, using...
  • cpsolver

  • Referenced in 2 articles [sw39335]
  • cpsolver: Local-search based solver of Constraint Satisfaction and Optimization Problems...
  • PicHunter

  • Referenced in 53 articles [sw14896]
  • accomplish this, PicHunter uses Bayesian learning based on a probabilistic model of a user ... combined with the selections made during a search to estimate the probability associated with each ... previously proposed systems. However, even with this constraint and simple image features, PicHunter is able...
  • BiDAG

  • Referenced in 2 articles [sw31037]
  • employs a hybrid approach, combining constraint-based learning with search and score. A reduced search...