Advanced search

Showing result 11 - 12 of 12 essays matching the above criteria.

1. 11. Solving the Generalized Assignment Problem by column enumeration based on Lagrangian reduced costs

   University essay from Matematiska institutionen

   Author : Peter Brommesson; [2006]
   Keywords : Generalized Assignment Problem; Knapsack Problems; Lagrangian Relaxation; Overgeneration; Enumeration; Set Partitioning Problem.;

   Abstract : In this thesis a method for solving the Generalized Assignment Problem (GAP) is described. It is based on a reformulation of the original problem into a Set Partitioning Problem (SPP), in which the columns represent partial solutions to the original problem. READ MORE

3. 12. A Heuristic Method for Routing Snowplows After Snowfall

   University essay from Matematiska institutionen

   Author : Jana Sochor; Cecilia Yu; [2004]
   Keywords : Mathematical optimization; systems theory; Optimization; Lagrangian Relaxation; Subgradient; Heuristics; Routing; Snow Removal; Optimeringslära; systemteori;

   Abstract : Sweden experiences heavy snowfall during the winter season and cost effective road maintenance is significantly affected by the routing of snowplows. The routing problem becomes more complex as the SwedishNational Road Administration (Vägverket) sets operational requirements such as satisfying a time window for each road segment. READ MORE