Sökning: "branch-and-bound"
Visar resultat 1 - 5 av 32 avhandlingar innehållade ordet branch-and-bound.
1. On Models and Methods for Global Optimization of Structural Topology
Sammanfattning : This thesis consists of an introduction and sevenindependent, but closely related, papers which all deal withproblems in structural optimization. In particular, we considermodels and methods for global optimization of problems intopology design of discrete and continuum structures. LÄS MER
2. 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
3. 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
4. Distributed Coordination in Multiantenna Cellular Networks
Sammanfattning : Wireless communications are important in our highly connected world. The amount of data being transferred in cellular networks is steadily growing, and consequently more capacity is needed. This thesis considers the problem of downlink capacity improvement from the perspective of multicell coordination. LÄS MER
5. On Optimization in Design of Telecommunications Networks with Multicast and Unicast Traffic
Sammanfattning : .... LÄS MER