Sökning: "combinatorial problems"

Visar resultat 11 - 15 av 97 avhandlingar innehållade orden combinatorial problems.

  1. 11. Enumerative approaches and structural results for selected combinatorial problems

    Författare :Denys Shcherbak; Gerold Jäger; Lars-Daniel Öhman; Lam Clement; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Graph; zero forcing; Latin squares; Youden squares; designs;

    Sammanfattning : .... LÄS MER

  3. 12. Set Constraints for Local Search

    Författare :Magnus Ågren; Pierre Flener; Justin Pearson; Gilles Pesant; Uppsala universitet; []
    Nyckelord :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;

    Sammanfattning : 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. LÄS MER

  4. 13. Certifying Correctness for Combinatorial Algorithms : by Using Pseudo-Boolean Reasoning

    Författare :Stephan Gocht; Parallella System; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; certifying algorithms; 0-1 linear inequalities; combinatorial algorithms; proof logging;

    Sammanfattning : Over the last decades, dramatic improvements in combinatorialoptimisation algorithms have significantly impacted artificialintelligence, operations research, and other areas. These advances,however, are achieved through highly sophisticated algorithms that aredifficult to verify and prone to implementation errors that can causeincorrect results. LÄS MER

  5. 14. Decomposition Methods for Combinatorial Optimization

    Författare :Uledi Ngulo; Torbjörn Larsson; Nils-Hassan Quttineh; Egbert Mujuni; Athanasios Migdalas; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis aims at research in the field of combinatorial optimization. Problems within this field often posses special structures allowing them to be decomposed into more easily solved subproblems, which can be exploited in solution methods. These structures appear frequently in applications. LÄS MER

  7. 15. A Study of Combinatorial Optimization Problems in Industrial Computer Systems

    Författare :Markus Bohlin; Björn Lisper; Per Kreuger; Mikael Sjödin; Petru Eles; Mälardalens högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Computer science; Datalogi; Computer Science; datavetenskap;

    Sammanfattning : A combinatorial optimization problem is an optimization problem where the number of possible solutions are finite and grow combinatorially with the problem size. Combinatorial problems exist everywhere in industrial systems. LÄS MER