Sökning: "branch-and-cut"

Hittade 3 avhandlingar innehållade ordet branch-and-cut.

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

    Författare :Mikael Prytz; KTH; []
    Nyckelord :telecommunications; network design; network dimensioning; network configuration; multicast traffic; location; network optimization; Lagrangian decomposition; branch-and-bound; branch-and-cut; shortest path routing;

    Sammanfattning : .... LÄS MER

  3. 2. Mathematical Modelling for Load Balancing and Minimization of Coordination Losses in Multirobot Stations

    Författare :Edvin Åblad; Stiftelsen Fraunhofer-Chalmers Centrum för Industrimatematik (FCC); []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; decomposition; mathematical modelling; Voronoi diagram; set packing; automotive manufacturing; Smart Assembly 4.0; continuous collision detection; motion planning; vehicle routing; makespan minimization;

    Sammanfattning : The automotive industry is moving from mass production towards an individualized production, in order to improve product quality and reduce costs and material waste. This thesis concerns aspects of load balancing of industrial robots in the automotive manufacturing industry, considering efficient algorithms required by an individualized production. LÄS MER

  4. 3. Mathematical Models and Algorithms for Wireless Network Design and Optimization

    Författare :Yuan Li; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; max-min flow; directional antenna; optimization; integer programming; cellular backhaul network design; delay minimization; SINR; compatible set;

    Sammanfattning : Optimization techniques always play an important role in designing high-performance wireless systems. This presented thesis studies a selected set of optimization problems for different kinds of wireless networks, making use of mathematical programming techniques to find optimal solutions and of efficient heuristics to find near-optimal solutions. LÄS MER