Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"Branch-and-Cut Method"”.
-
A Branch-and-Cut Method for Solving the Bilevel Clique Interdiction Problem
… The algorithm presented in this thesis uses a branch and cut approach to solve the proposed problem. This algorithm is expected to be usable on any social network, thereby improving the study of many network problems including terrorist cells or marketing strategies.
-
Algorithms for solving linear integer progamming problems
<p>This thesis discusses several methods used to solve linear integer programming problems. Chapters 1-3 give the necessary linear programming background. Chapter 4 introduces integer programming and describes, in general, the two classes of solution methods -enumeration and cutting planes. Chapter …
-
Ολοκλήρωση ενεργειακών αγορών
… of day-ahead electricity markets organized and operated under fundamentally different market designs, i.e. organized as power pools or power exchanges, and searches for the appropriate methodology for the calculation of the optimal daily power exchanges between Member States, through the …
-
Coded caching for cache-aided communication and computing with nonuniform demands
… multiple cache-enabled users with nonuniform demands. We thoroughly characterize the structure of the optimal cache placement of the coded caching scheme (CCS).We show there are at most three file groups in the optimal placement and obtain the closed-form solution in each file grouping case. A …
-
Μεσοπρόθεσμος προγραμματισμός λειτουργίας υδροηλεκτρικών σταθμών σε ανταγωνιστική αγορά ηλεκτρικής ενέργειας
… the general framework of medium-term scheduling and simulation of power systems and energy markets, focusing on the significant contribution of hydroplants as well as the influence of the various sources of uncertainty. Due to the large impact of the short-term system and market operation on …
-
Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem
… dissertation has been focused on exploiting the branch-and-price (BNP) method for the solution of various stochastic mixed integer programming problems (MIPs). In particular, we address the stochastic generalized assignment problem (SGAP), a hospital staff scheduling problem (HSSP), a stochastic …