Sökning: "Magnus Axén"

Hittade 1 uppsats innehållade orden Magnus Axén.

  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