Advanced search
Showing result 1 - 5 of 12 essays matching the above criteria.
-
1. Lagrangian Bounding and Heuristics for Bi-Objective Discrete Optimisation
University essay from Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakultetenAbstract : For larger instances of multi-objective optimisation problems, the exact Pareto frontier can be both difficult and time-consuming to calculate. There is a wide range of methods to find feasible solutions to such problems, but techniques for finding good optimistic bounds to compare the feasible solutions with are missing. READ MORE
-
2. Location Planning Considering Delivery Time and Service Level Constraints A Heuristic Solution Approach to a Linear Optimization Problem from an Automotive Spare Parts Network
University essay from Göteborgs universitet/Graduate SchoolAbstract : This thesis addresses the challenge to model a warehouse location problem under consideration of delivery time and service level constraints. For identification of appropriate modelling techniques, literature research is conducted to identify relevant models using similar approaches. READ MORE
-
3. Probabilistic Multidisciplinary Design Optimization on a high-pressure sandwich wall in a rocket engine application
University essay from Umeå universitet/Institutionen för fysikAbstract : A need to find better achievement has always been required in the space industrythrough time. Advanced technologies are provided to accomplish goals for humanityfor space explorer and space missions, to apprehend answers and widen knowledges. READ MORE
-
4. Numerical approach of a hybrid rocket engine behaviour : Modelling the liquid oxidizer injection using a Lagrangian solver
University essay from KTH/MekanikAbstract : To access and operate in space, a wide range of propulsion systems has been developed, from high-thrust chemical propulsion to low-thrust electrical propulsion, and new kind of systems are considered, such as solar sails and nuclear propulsion. Recently, interest in hybrid rocket engines has been renewed due to their attractive features (safe, cheap, flexible) and they are now investigated and developed by research laboratories such as ONERA. READ MORE
-
5. Finding the Densest Common Subgraph with Linear Programming
University essay from Göteborgs universitet/Institutionen för data- och informationsteknikAbstract : This thesis studies the concept of dense subgraphs, speci cally for graphs with multiple edge sets. Our work improves the running time of an existing Linear Program (LP) for solving the Densest Common Subgraph problem. READ MORE