Sökning: "branch bound"
Visar resultat 1 - 5 av 35 uppsatser innehållade orden branch bound.
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
2. Origin of blue straggler stars in the Milky Way halo
Master-uppsats, Lunds universitet/Astrofysik; Lunds universitet/Fysiska institutionenSammanfattning : Blue straggler stars (BSSs) are exotic stellar objects that appear to be younger than the age of the population they come from suggests. They are observed as the extension of the main sequence stars, beyond the turn-off point. LÄS MER
3. Effects of Design Space Discretization on Constraint Based Design Space Exploration
Master-uppsats, KTH/Matematik (Avd.)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. Inflexible Patterns : Kay Fiskers Plads and the Fight for Quality Public Space
Master-uppsats, Malmö universitet/Institutionen för Urbana Studier (US)Sammanfattning : Kay Fiskers Plads lies at the junction of Copenhagen’s south-bound metro line, M1, and the Øresundtog train route connecting the city with Malmö, Sweden across the Øresund channel. Surrounding the plaza are Scandinavia’s largest shopping mall, Fields, Neroport offices, Sweden’s Ferring Pharmaceuticals branch and office spaces owned by KLP Ejendomme, a Norwegian based real estate firm. LÄS MER
5. k-means Clustering as a Mixed Integer Programming Problem
Kandidat-uppsats, KTH/Skolan för teknikvetenskap (SCI)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