Sökning: "Blandade heltaltsproblem"
Hittade 1 uppsats innehållade orden Blandade heltaltsproblem.
1. Imitation Learning on Branching Strategies for Branch and Bound Problems
Master-uppsats, KTH/Matematisk statistikSammanfattning : 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
Resultatsidor:
1