Sökning: "combinatorial optimization problems"

Visar resultat 1 - 5 av 20 uppsatser innehållade orden combinatorial optimization problems.

  1. 1. Comparison of two mixed integer solvers with real world data from combinatorial auctions

    Kandidat-uppsats, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Kristoffer Norrman; [2023]
    Nyckelord :;

    Sammanfattning : Coupa is a software company specialising in Business Spending Management, BSM. In the Uppsala office they utilise MIP solvers to help their clients lower sourcing outlays by translating sourcing auc- tions into MIP problems [1] [2]. LÄS MER

  3. 2. The Applicability and Scalability of Graph Neural Networks on Combinatorial Optimization

    Master-uppsats, KTH/Matematik (Avd.)

    Författare :Peder Hårderup; [2023]
    Nyckelord :applied mathematics; combinatorial optimization; machine learning; graph neural networks; scalability; tillämpad matematik; kombinatorisk optimering; maskininlärning; grafiska neurala nätverk; skalbarhet;

    Sammanfattning : This master's thesis investigates the application of Graph Neural Networks (GNNs) to address scalability challenges in combinatorial optimization, with a primary focus on the minimum Total Dominating set Problem (TDP) and additionally the related Carrier Scheduling Problem (CSP) in networks of Internet of Things. The research identifies the NP-hard nature of these problems as a fundamental challenge and addresses how to improve predictions on input graphs of sizes much larger than seen during training phase. LÄS MER

  4. 3. The Quantum Approximate Optimization Algorithm and it's Applications

    Kandidat-uppsats, Uppsala universitet/Institutionen för fysik och astronomi

    Författare :Erik Bashore; [2023]
    Nyckelord :Quantum computing; quantum optimization; combinatorial optimization problems;

    Sammanfattning : This is a project with the ambition of demonstrating the possibilities and applications of the quantum approximation optimization algorithm (QAOA). Throughout the paper discussions on the theoretical background and fundamentals of the algorithm will be done by examining the relevant nomenclature. LÄS MER

  5. 4. Randomized heuristic scheduling of electrical distribution network maintenance in spatially clustered balanced zones

    Master-uppsats, KTH/Geoinformatik

    Författare :Carolina Offenbacher; Ellen Thornström; [2022]
    Nyckelord :Capacitated Vehicle Routing Problem; Electrical distribution network; Heuristic algorithm; Scheduling; Handelsresandeproblemet; Eldistributionsnätverk; Heurustik algortim; Schemaläggning;

    Sammanfattning : Reliable electricity distribution systems are crucial; hence, the maintenance of such systems is highly important, and in Sweden strictly regulated. Poorly planned maintenance scheduling leads unnecessary driving which contributes to increased emissions and costs. LÄS MER

  7. 5. Discrete Flower Pollination Algorithm for the Graph Coloring Problem

    Kandidat-uppsats, KTH/Datavetenskap

    Författare :Samuel Falk; Erik Nordlöf; [2022]
    Nyckelord :;

    Sammanfattning : The graph coloring problem (GCP) is a famous NP-hard problem applicable to many real-world problems. The Flower Pollination Algorithm (FPA) is a relatively recently developed algorithm based on the pollination-behaviors of flowers. It has seen great results in single- and multi-objective optimization in continuous search spaces. LÄS MER