Sökning: "Branch and Bound Technique"
Visar resultat 1 - 5 av 9 avhandlingar innehållade orden Branch and Bound Technique.
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. Optimization Approaches for Design of Congestion Pricing Schemes
Sammanfattning : 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. LÄS MER
3. Techniques for Efficient Implementation of FIR and Particle Filtering
Sammanfattning : FIR filters occupy a central place many signal processing applications which either alter the shape, frequency or the sampling frequency of the signal. FIR filters are used because of their stability and possibility to have linear-phase but require a high filter order to achieve the same magnitude specifications as compared to IIR filters. LÄS MER
4. Mechanical Properties of Arteries : An In Vivo Parameter Identification Method
Sammanfattning : In this dissertation, a method is proposed that identifies the mechanical properties of arteries in vivo. The mechanical properties of an artery are linked to the development of cardiovascular diseases. LÄS MER
5. Bilinear optimization in computational decision analysis
Sammanfattning : In real-life decision analysis, significant recognition has been given to theunrealistic expectation of numerically precise information. Many modernapproaches attempting to handle imprecision have focused more on representationand less on evaluation. LÄS MER