Due to their widespread applicability, graphs and networks appear in various contexts. The increasing scale of graphs encountered in the real-world requires the developmentof efficient algorithms that run reasonably fast and produce close to optimal solutions.
The main focus of this thesis is the development of fast graph algorithms for...
The focus of this thesis is on evaluating, designing, and applying statistical methods that elucidate molecular mechanisms by seeking to understand the pathways that contribute to disease. Chapter 1 introduces the field and motivates the work in this thesis. Chapters 2, 3, and 4 describe original work. Chapter 5 recapitulates...
This thesis studies three approaches for solving linear programs with complementarity constraints (LPCC). The focus of Chapter 2 lies on difference-of-convex (DC) penalty formulations and the associated difference-of-convex algorithm (DCA) for computing stationary solutions of LPCCs. We concentrate on three such formulations and establish connections between their stationary solutions and...
Column generation algorithms are used for MILP problems. The formulation was initially proposed by Ford and
Fulkerson in 1958 . The main advantage of column generation is that not all possibilities need to be enumerated.
Instead, the problem is first formulated as a restricted master problem (RMP). This RMP has...
Classic mechanism design studies the implementation of optimal systems or processes in the presence of multiple selfish and fully rational agents. The theory of mechanism design has been one of the most celebrated advances in the economics discipline, especially with regards to auctions Myerson (1981),Vickrey (1961), Clarke (1971), Groves (1973)....