Search for dissertations about: "Branch and bound"

Showing result 1 - 5 of 32 swedish dissertations containing the words Branch and bound.

  1. 1. Optimizing and Approximating Algorithms for the Single and Multiple Agent Precedence Constrained Generalized Traveling Salesman Problem

    Author : Raad Salman; Göteborgs universitet.; Gothenburg University.; [2017]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; PCGmTSP; GTSP; SOP; mTSP; branch and bound; asymmetric generalized multiple traveling salesman problem; VRP; PCGTSP; dynamic programming; sequential ordering problem; vehicle routing problem; ant colony optimization; metaheuristic local search heuristic; precedence constraints; edge exchange; ant colony optimization; mTSP; edge exchange; precedence constraints; dynamic programming; branch and bound; PCGTSP; SOP; VRP; sequential ordering problem; vehicle routing problem; metaheuristic local search heuristic; GTSP;

    Abstract : 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. READ MORE

  2. 2. Applications of Integer Quadratic Programming in Control and Communication

    University dissertation from Institutionen för systemteknik

    Author : Daniel Axehill; Anders Hansson; Anders Rantzer; [2005]
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Optimization; Model Predictive Control; CDMA; Quadratic Programming; Mixed Integer Quadratic Programming; Dual active set methods; Riccati recursion; Branch and bound; TECHNOLOGY Information technology Automatic control; TEKNIKVETENSKAP Informationsteknik Reglerteknik;

    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 principles is the discrete-time method Model Predictive Control (MPC). READ MORE

  3. 3. On Optimization in Design of Telecommunications Networks with Multicast and Unicast Traffic

    University dissertation from Stockholm : Matematik

    Author : Mikael Prytz; [2002]
    Keywords : telecommunications; network design; network dimensioning; network configuration; multicast traffic; location; network optimization; Lagrangian decomposition; branch-and-bound; branch-and-cut; shortest path routing;

    Abstract : .... READ MORE

  4. 4. Algorithms, measures and upper bounds for satisfiability and related problems

    University dissertation from Linköping, Sweden : Department of Computer and Information Science, Linköpings universitet

    Author : Magnus Wahlström; Peter Jonsson; Oliver Kullmann; [2007]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Exact algorithms; upper bounds; algorithm analysis; satisfiability; TECHNOLOGY Information technology Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap;

    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

  5. 5. Distributed Coordination in Multiantenna Cellular Networks

    University dissertation from Stockholm, Sweden : KTH Royal Institute of Technology

    Author : Rasmus Brandt; Mats Bengtsson; Joakim Jaldén; Ignacio Santamaría; [2016]
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; multicell MIMO; base station clustering; coordinated precoding; branch and bound; coalitional game theory; intercluster interference; CSI acquisition; hardware impairments; discrete rate selection; Electrical Engineering; Elektro- och systemteknik;

    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