Sökning: "column generation"
Visar resultat 16 - 20 av 43 avhandlingar innehållade orden column generation.
16. Decomposition schemes for the traveling salesman subtour problem
Sammanfattning : Given an undirected graph with edge costs and both revenues and weights on the vertices, the Traveling Salesman Subtour Problem is to find a subtour that passes a depot vertex, satisfies a knapsack constraint on the vertex weights, and that minimizes edge costs minus vertex revenues along the subtour. This problem generalizes the Traveling Salesman Problem and is therefore -hard. LÄS MER
17. Strong blast wave interaction with multiphase media
Sammanfattning : The interaction of a blast wave propagating in air with different fluids like water column, aqueous foam and thermal/density inhomogeneity have been studied both experimentally and numerically. The blast waves were generated at atmospheric conditions in a newly constructed exploding wire facility. LÄS MER
18. 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
19. Decision Support for Strategic Traffic Management : An Optimization-Based Methodology
Sammanfattning : Strategic traffic management aims at the improvement of the functionality of the traffic network. This functionality is typically expressed in terms of the traffic flows and the travel times in the network. In this thesis a methodology for decision support in long-term traffic management is proposed. LÄS MER
20. Ring network design in telecommunications : optimization based solution approaches
Sammanfattning : When designing a telecommunication network, one often wish to include some kind of survivability requirement, for example that the network should be two-connected. A two-connected network fulfills the requirement that there should be at least two paths with no links in common between all pairs of nodes. LÄS MER