Essays about: "Constraint Solving Problems"

Showing result 6 - 10 of 30 essays containing the words Constraint Solving Problems.

  1. 6. Using maximal feasible subset of constraints to accelerate a logic-based Benders decomposition scheme for a multiprocessor scheduling problem

    University essay from Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakulteten

    Author : Alexander Grgic; Filip Andersson; [2022]
    Keywords : logic-based Benders decomposition; maximal feasible subset of constraints; irreducible infeasible subset of constraints; multiprocessor scheduling;

    Abstract : Logic-based Benders decomposition (LBBD) is a strategy for solving discrete optimisation problems. In LBBD, the optimisation problem is divided into a master problem and a subproblem and each part is solved separately. READ MORE

  3. 7. Security Countermeasure Selection as a Constraint Solving Problem

    University essay from Linnéuniversitetet/Institutionen för datavetenskap och medieteknik (DM)

    Author : Aya Kathem; [2021]
    Keywords : Logical attack graph; Optimization problem; Constraint Solving Problems; Computer Network Security.;

    Abstract : Network systems often contain vulnerabilities that remain unmitigated in a network for various reasons, such as lack of a patch and limited budget. Adversaries can exploit these existing vulnerabilities through different strategies. READ MORE

  4. 8. A Linter for Static Analysis of MiniZinc Models

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Erik Rimskog; [2021]
    Keywords : linter MiniZinc combinatorial optimisation static analysis models;

    Abstract : MiniZinc is a modelling language for constraint satisfaction and optimisation problems. It can be used to solve difficult problems by declaratively modelling them and giving them to a generic solver. A linter, a tool for static analysis, is implemented for MiniZinc to provide analysis for improving models. READ MORE

  5. 9. Scheduling of an underground mine by combining logic based Benders decomposition and a constructive heuristic

    University essay from Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakulteten

    Author : Emil Lindh; Kim Olsson; [2021]
    Keywords : Underground mine scheduling; Cut-and-fill mining; Logic-based Benders decomposition; Constructive heuristic;

    Abstract : Underground mining is a complex operation that requires careful planning. The short-term scheduling, which is the scheduling of the tasks involved in the excavation process, is an important part of the planning process. READ MORE

  6. 10. Convergence Properties for Different Null Space Bases When Solving the Initial Margin Optimization Problem Using CMA-ES

    University essay from KTH/Matematisk statistik

    Author : Jacob Barnholdt; Filip Carlsson; [2020]
    Keywords : Financial mathematics; CMA-ES; Optimization; Initial Margin; Null space representations; Finansiell matematik; CMA-ES; Optimering; Initial Margin; Nollrumsrepresentationer;

    Abstract : This thesis evaluates how the evolutionary algorithm CMA-ES (Covariance Matrix Adaption Evolution Strategy) can be used for optimizing the total initial margin for a network of banks trading bilateral OTC derivatives. The algorithm is a stochastic method for optimization of non-linear and, but not limited to, non-convex functions. READ MORE