Sökning: "Subgradient optimization"
Visar resultat 11 - 15 av 20 avhandlingar innehållade orden Subgradient optimization.
11. Decomposition Methods for Combinatorial Optimization
Sammanfattning : This thesis aims at research in the field of combinatorial optimization. Problems within this field often posses special structures allowing them to be decomposed into more easily solved subproblems, which can be exploited in solution methods. These structures appear frequently in applications. LÄS MER
12. Short Term Scheduling of Hydrothermal Power Systems With Integer Hydro Constraints
Sammanfattning : The thesis presents models for short term planning (24 hours) of a hyro dominated hydrothermal power system. The purpose of the models is to minimizae the system operation costs to provide a forecasted load and keep enough spinning reserve... LÄS MER
13. Mathematical modelling and methodology for cost optimization of variable renewable electricity integration
Sammanfattning : The global production of electricity contributes significantly to the release of carbon dioxide emissions. Therefore, a transformation of the electricity system is of vital importance in order to restrict global warming. LÄS MER
14. Optimization of Snow Removal in Cities
Sammanfattning : Removing snow in a city is an unavoidable task in Nordic countries like Sweden. A number of streets in an area need to be cleared of snow by a limited number of vehicles and the tours for the vehicles must be planned in order to minimize the time and/or cost. LÄS MER
15. 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
