This master's thesis describes modified Chinese Postman Problems. These Problems are solved by (mixed) integer linear programming. The modified problems and also used approach (integer programming) belong at least to the NP complexity class. The thesis analyzes, compares and estimates computational complexity of each model. Based on this analysis, usability of described models for solving real-life problems is deduced. The models are focused on problems in urban environment. Therefore, it is possible to apply these models on problems like optimization of a waste collection or road maintenance. Graph and problem generator is programmed for purposes of this thesis.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:150278 |
| Date | January 2010 |
| Creators | Jelínek, Tomáš |
| Contributors | Fábry, Jan, Pelikán, Jan |
| Publisher | Vysoká škola ekonomická v Praze |
| Source Sets | Czech ETDs |
| Language | Czech |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0022 seconds