Sökning: "branch and bound"
Visar resultat 1 - 5 av 40 avhandlingar innehållade orden branch and bound.
1. Optimizing and Approximating Algorithms for the Single and Multiple Agent Precedence Constrained Generalized Traveling Salesman Problem
Sammanfattning : In the planning phases of automated manufacturing, generating efficient programs for robot stations is a crucial problem which needs to be solved. One aspect of the programming is the optimization of task sequences, such as series of welds or measuring points, so that the cycle time is minimized. LÄS MER
2. Applications of Integer Quadratic Programming in Control and Communication
Sammanfattning : The main topic of this thesis is integer quadratic programming with applications to problems arising in the areas of automatic control and communication. One of the most widespread modern control principles is the discrete-time method Model Predictive Control (MPC). LÄS MER
3. Atlantic Water in the Nordic Seas : A satellite altimetry perspective on ocean circulation
Sammanfattning : The Atlantic Water in the Nordic Seas contributes to the mild climate of Northern Europe and is the main oceanic source of heat for the Arctic. The northward bound transport of the warm and saline Atlantic Water is mediated by a topographically constrained cyclonic boundary current along the Norwegian continental slope. LÄS MER
4. On Optimization in Design of Telecommunications Networks with Multicast and Unicast Traffic
Sammanfattning : .... LÄS MER
5. Optimization Models and Methods for Communication Network Design and Routing
Sammanfattning : Many decision problems in communication network planning can be approached by optimization methodologies. In this thesis we study communication network design and routing. LÄS MER