Search for dissertations about: "constraint-based local search"

Found 3 swedish dissertations containing the words constraint-based local search.

  2. 1. Set Constraints for Local Search

    Author : Magnus Ågren; Pierre Flener; Justin Pearson; Gilles Pesant; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Computer science; combinatorial problems; constraint-based local search; constraint-directed search; constraint programming; incremental algorithms; monadic existential second-order logic; neighbourhoods; penalty; set variables; set constraints; variable conflicts; Computer science; Datavetenskap; Datavetenskap; Computer Science;

    Abstract : Combinatorial problems are ubiquitous in our society and solving such problems efficiently is often crucial. One technique for solving combinatorial problems is constraint-based local search. Its compositional nature together with its efficiency on large problem instances have made this technique particularly attractive. READ MORE

  4. 2. From Declarative Models to Local Search

    Author : Gustav Björdal; Pierre Flener; Justin Pearson; Laurent Michel; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; discrete optimisation; combinatorial optimisation; local search; large-neighbourhood search; MiniZinc; constraint programming; declarative modelling; declarative neighbourhoods; Computer Science; Datavetenskap;

    Abstract : A solver is a general-purpose software for solving optimisation problems. It takes as input a description of a problem, called a model, and uses a collection of algorithms, called its solving technology, to ideally produce an optimal solution as output. Most solvers have a modelling language that cannot be processed by other solvers. READ MORE

  5. 3. High-level modelling and local search

    Author : Magnus Ågren; Pierre Flener; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Datavetenskap; Computer Science;

    Abstract : Combinatorial optimisation problems are ubiquitous in our society and appear in such varied guises as DNA sequencing, scheduling, configuration, airline-crew and nurse rostering, combinatorial auctions, vehicle routing, and financial portfolio design. Their efficient solution is crucial to many people and has been the target for much research during the last decades. READ MORE