Search for dissertations about: "Branch and bound"
Showing result 6 - 10 of 39 swedish dissertations containing the words Branch and bound.
-
6. On Complexity Certification of Branch-and-Bound Methods for MILP and MIQP with Applications to Hybrid MPC
Abstract : In model predictive control (MPC), an optimization problem is solved at each time step, in which the system dynamics and constraints can directly be taken into account. The MPC concept can be further extended to the control of hybrid systems, where a part of the state and control variables has a discrete set of values. READ MORE
-
7. Distributed Coordination in Multiantenna Cellular Networks
Abstract : 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. READ MORE
-
8. Algorithms, measures and upper bounds for satisfiability and related problems
Abstract : The topic of exact, exponential-time algorithms for NP-hard problems has received a lot of attention, particularly with the focus of producing algorithms with stronger theoretical guarantees, e.g. upper bounds on the running time on the form O(c^n) for some c. READ MORE
-
9. Optimization Approaches for Design of Congestion Pricing Schemes
Abstract : In recent years, there has been a growing interest in congestion pricing as a tool for solving traffic congestion problems in urban areas. However, the transportation system is complex and to design a congestion pricing scheme, i.e. to decide where and how much to charge the road users, is not trivial. READ MORE
-
10. Integer Quadratic Programming for Control and Communication
Abstract : 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 methods is Model Predictive Control (MPC). In each sampling time, MPC requires the solution of a Quadratic Programming (QP) problem. READ MORE