Sökning: "Branch-and-Cut"

Hittade 3 uppsatser innehållade ordet Branch-and-Cut.

  1. 1. Optimal Time-Varying Cash Allocation

    Master-uppsats, KTH/Matematisk statistik

    Författare :David Olanders; [2020]
    Nyckelord :Statistics; Applied Mathematics; Optimization; Cash Allocation; Network Theory; Mixed Integer Linear Program; Transaction Costs; Branch-and-Cut; Statistik; tillämpad matematik; optimering; kapitalallokering; nätverksteori; Mixed Integer Linear Program; transaktionskostnader; Branch-and-Cut;

    Sammanfattning : A payment is the most fundamental aspect of a trade that involves funds. In recent years, the development of new payment services has accelerated significantly as the world has moved further into the digital era. This transition has led to an increased demand of digital payment solutions that can handle trades across the world. LÄS MER

  3. 2. Unit commitment model development for hydropower on the Day-Ahead spot market.

    Master-uppsats, KTH/Skolan för industriell teknik och management (ITM)

    Författare :Romain Radulesco; [2020]
    Nyckelord :Unit Commitment Problem; Hydropower; Electricity Exchange; Spot Market; Mixed Integer Linear Programming; Optimization; GAMS; Water Value; Water Transfer; Multi-reservoir;

    Sammanfattning : In the aftermath of the liberalization of European Energy Markets in the 2000s, Power Exchange platforms have constantly evolved towards more integrated and competitive designs, where quality forecasts and effective optimization strategies play decisive roles. This study presents the development of a hydropower scheduling optimization algorithm for the Day-Ahead spot market using Mixed Integer Linear Programming (MILP). LÄS MER

  4. 3. A branch-and-cut method for the Vehicle Relocation Problem in the One-Way Car-Sharing

    Master-uppsats, KTH/Optimeringslära och systemteori

    Författare :Szymon Janusz Albinski; [2015]
    Nyckelord :;

    Sammanfattning : The purpose of this thesis is to develop an algorithm which solves the Vehicle Relocation Problem in the One-Way Car-Sharing (VRLPOWCS) as fast as possible. The problem describes the task of relocating the cars to areas with the largest demand. The chauffeurs who relocate the cars are transported by shuttle buses. LÄS MER