Essays about: "Constraint-Based Local Search"

Showing result 1 - 5 of 10 essays containing the words Constraint-Based Local Search.

1. 1. Contributions to a New CBLS Backend for MiniZinc

   University essay from Uppsala universitet/Institutionen för informationsteknologi

   Author : Maarten Lucas Flippo; [2022]
   Keywords : ;

   Abstract : MiniZinc is a language which enables the modelling of combinatorial optimisation and satisfaction problems independently from any particular problem solver and its technology. One technology for solving combinatorial optimisation and satisfaction problems is constraint-based local search (CBLS). READ MORE

3. 2. Invariant Propagation for Solvers of Constraint-Based Local Search Technology

   University essay from Uppsala universitet/Institutionen för informationsteknologi

   Author : Samuel Bodin; [2022]
   Keywords : ;

   Abstract : Constraint-based local search is a technology for solving constrained optimisation problems and constraint satisfaction problems. Solvers of this kind rely on the notion of invariants and an invariant propagation algorithm during search. READ MORE

4. 3. Generating a CBLS Invariant Structure from a FlatZinc Model

   University essay from Uppsala universitet/Institutionen för informationsteknologi

   Author : Max Perea Düring; [2021]
   Keywords : combinatorial optimisation MiniZinc CBLS constraint model local search solver invariant structure;

   Abstract : Constraint-Based Local Search (CBLS) is a technology used to solve computationally hard optimisation problems. A model written in a solver-independent modelling language needs to be processed before it can be solved by a CBLS solver. In this processing step, it is necessary to identify invariants and create an invariant structure. READ MORE

5. 4. String Variables for Constraint-Based Local Search

   University essay from Uppsala universitet/Avdelningen för datalogi

   Author : Gustav Björdal; [2016]
   Keywords : ;

   Abstract : String variables occur as a natural part of many computationally challenging problems. Usually, such problems are solved using problem-specific algorithms implemented from first principles, which can be a time-consuming and error-prone task. READ MORE

6. 5. The First Constraint-Based Local Search Backend for MiniZinc

   University essay from Uppsala universitet/Institutionen för informationsteknologi

   Author : Gustav Björdal; [2014]
   Keywords : ;

   Abstract : MiniZinc is a modelling language used to model combinatorial optimisation and satisfaction problems, which can then be solved in a backend solver. There are many different backend solvers based on different technologies such as constraint programming, mathematical programming, or Boolean satisfiability solving. READ MORE