Sökning: "Dag Wedelin"
Hittade 2 avhandlingar innehållade orden Dag Wedelin.
1. Efficient Algorithms for Probabilistic Inference, Combinatorial Optimization and the Discovery of Causal Structure from Data
Sammanfattning : In the first article we present a network based algorithm for probabilistic inference in an undirected structure. We show that the algorithm can be used as a general purpose approximation algorithm for combinatorial optimization, and discuss issues of approximation and convergence. LÄS MER
2. Models and solution methods for large-scale industrial mixed integer programming problems
Sammanfattning : This thesis deals with large-scale industrial problems that can be formulated using mixed integer linear programming (MIP) models. Because of the large problem size, it is not often possible to apply standard solution methods. Therefore special techniques must be used. LÄS MER
Resultatsidor:
1