Sökning: "combinatorial set of problem instances"

Visar resultat 1 - 5 av 8 avhandlingar innehållade orden combinatorial set of problem instances.

  1. 1. 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

  3. 2. Hardness of Constraint Satisfaction and Hypergraph Coloring : Constructions of Probabilistically Checkable Proofs with Perfect Completeness

    Författare :Sangxia Huang; Johan Håstad; Rishi Saket; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Combinatorial optimization; approximation; inapproximability; hardness; probabilistically checkable proofs; pcp; perfect completeness; boolean constraint satisfaction problem; csp; graph coloring; hypergraph coloring; direct sum; superposition; label cover; Computer Science; Datalogi;

    Sammanfattning : A Probabilistically Checkable Proof (PCP) of a mathematical statement is a proof written in a special manner that allows for efficient probabilistic verification. The celebrated PCP Theorem states that for every family of statements in NP, there is a probabilistic verification procedure that checks the validity of a PCP proof by reading only 3 bits from it. LÄS MER

  4. 3. Mathematical modelling for optimization of truck tyres selection

    Författare :Zuzana Sabartova; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; simulation-based optimization; truck tyres selection; surrogate model; radial basis function interpolation; rolling resistance coefficient; combinatorial set of problem instances; global optimization; global optimization;

    Sammanfattning : This thesis, which consists of an introduction and three appended papers, concerns the optimal selection of tyres for a given vehicle configuration and an operating environment in which the vehicle is to be used. The optimization problem stems from an industrial project performed in cooperation between Chalmers University of Technology and Volvo Group Trucks Technology (GTT). LÄS MER

  5. 4. On Some Combinatorial Optimization Problems : Algorithms and Complexity

    Författare :Hannes Uppman; Peter Jonsson; Christer Bäckström; Ulf Nilsson; Stanislav Živný; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computational complexity; optimization; constraint satisfaction problem;

    Sammanfattning : This thesis is about the computational complexity of several classes of combinatorial optimization problems, all related to the constraint satisfaction problems.A constraint language consists of a domain and a set of relations on the domain. For each such language there is a constraint satisfaction problem (CSP). LÄS MER

  7. 5. Optimization of truck tyres selection

    Författare :Zuzana Nedelkova; Göteborgs universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; radial basis function; categorical variables; truck tyres; simulation-based optimization; surrogate model; approximately optimal solution; efficient solution; rolling resistance coefficient; vehicle dynamics; simulation-based optimization;

    Sammanfattning : This thesis, which consists of an introduction and five appended papers, concerns the optimal selection of tyres for a variety of vehicle configurations as well as operating environments. The selection problem stems from a project cooperation between Chalmers University of Technology and Volvo Group Trucks Technology. LÄS MER