Essays about: "branch and bound"
Showing result 1 - 5 of 26 essays containing the words branch and bound.
-
1. Imitation Learning on Branching Strategies for Branch and Bound Problems
University essay from KTH/Matematisk statistikAbstract : 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. READ MORE
-
2. Origin of blue straggler stars in the Milky Way halo
University essay from Lunds universitet/Astrofysik; Lunds universitet/Fysiska institutionenAbstract : 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. READ MORE
-
3. Effects of Design Space Discretization on Constraint Based Design Space Exploration
University essay from KTH/Matematik (Avd.)Abstract : 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. READ MORE
-
4. Inflexible Patterns : Kay Fiskers Plads and the Fight for Quality Public Space
University essay from Malmö universitet/Institutionen för Urbana Studier (US)Abstract : 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. READ MORE
-
5. k-means Clustering as a Mixed Integer Programming Problem
University essay from KTH/Skolan för teknikvetenskap (SCI)Abstract : 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. READ MORE