Sökning: "Branch-and-Bound"

Visar resultat 1 - 5 av 23 uppsatser innehållade ordet Branch-and-Bound.

  1. 1. Imitation Learning on Branching Strategies for Branch and Bound Problems

    Master-uppsats, KTH/Matematisk statistik

    Författare :Magnus Axén; [2023]
    Nyckelord :Graph Networks; Convolutions; MIP; Branch and Bound; Facility Location Problem; MDP; Imitation Learning; Graf nätverk; Faltning; Blandade heltaltsproblem; Branch and Bound; Facility Location Problem; Markov; Imitationsinlärning;

    Sammanfattning : A new branch of machine and deep learning models has evolved in constrained optimization, specifically in mixed integer programming problems (MIP). These models draw inspiration from earlier solver methods, primarily the heuristic, branch and bound. LÄS MER

  3. 2. Effects of Design Space Discretization on Constraint Based Design Space Exploration

    Master-uppsats, KTH/Matematik (Avd.)

    Författare :Ludwig Karlsson; [2023]
    Nyckelord :Constraint programming; Design space exploration; Discretization; Multiresolutional analysis; Villkorsprogrammering; Designrymdsutforskning; Diskretisering; Multiupplösningsanalys;

    Sammanfattning : Design Space Exploration (DSE) is the exploration of a space of possible designs with the goal of finding some optimal design according to some constraints and criteria. Within embedded systems design, automated DSE in particular can allow the system designer to efficiently find good solutions in highly complex design spaces. LÄS MER

  4. 3. k-means Clustering as a Mixed Integer Programming Problem

    Kandidat-uppsats, KTH/Skolan för teknikvetenskap (SCI)

    Författare :Hanna Werner; [2022]
    Nyckelord :;

    Sammanfattning : In this thesis k-means clustering is modelled as a mixed integer programming problem and then solved with a technique based on the concept of branch-and-bound. This approach is favourable when the solutions require high accuracy, but due to the heavy computations needed to solve large problems it is not regularly used. LÄS MER

  5. 4. Study of an automated testing procedure with dynamic job scheduling and automatic error handling

    Uppsats för yrkesexamina på avancerad nivå, Lunds universitet/Industriell elektroteknik och automation

    Författare :Tom Andersson; [2021]
    Nyckelord :Automation; Testing; Dynamic job scheduling; Automatic error handling; Concept generation; Heuristic rules; Dispatching rules; Branch and bound; A*; Dynamic programming; Beam search; Genetic algorithms; Tabu search; Simulations; C#; Technology and Engineering;

    Sammanfattning : During the production of Axis's cameras, the optics modules have to do a number of tests and calibrations that are performed in different test stations. The test and calibration sequence differs between different models. This has so far been done manually by having operators move the units between test stations. LÄS MER

  7. 5. Predictive Energy Management of Long-Haul Hybrid Trucks : Using Quadratic Programming and Branch-and-Bound

    Master-uppsats, Linköpings universitet/Fordonssystem

    Författare :Erik Jonsson Holm; [2021]
    Nyckelord :Predictive energy management; quadratic programming; branch-and-bound; mixed-integer quadratic programming; energy optimization; look-ahead control; model predictive control; receding horizon control; optimal control; convex optimization; heavy-duty vehicle; long-haul truck; hybrid electric vehicle;

    Sammanfattning : This thesis presents a predictive energy management controller for long-haul hybrid trucks. In a receding horizon control framework, the vehicle speed reference, battery energy reference, and engine on/off decision are optimized over a prediction horizon. LÄS MER