000 Informatik, Informationswissenschaft, allgemeine Werke
Filtern
Dokumenttyp
- Research Paper (4)
- Diplomarbeit (2)
- Bericht (2)
Sprache
- Englisch (8) (entfernen)
Schlagworte
- Algorithmus (1)
- Automobilindustrie (1)
- Flow-Shop-Problem (1)
- Flow-Shop-Scheduling (1)
- Informatik (1)
- Insolvenzrecht (1)
- Kraftfahrzeugindustrie (1)
- Lokales Suchverfahren (1)
- Maschinenbelegungsplanung (1)
- Medizin ; Recht (1)
- Netzwerk (1)
- Produktionsplanung (1)
- Rechtsvergleich (1)
- Reihenfolgeplanung (1)
- Simulated Annealing (1)
- Verhandlungsführung (1)
- Verwaltung (1)
- Verwaltungsinformatik (1)
- Verwaltungsreform (1)
- Wirtschaftspolitik (1)
During the nineties of the last century, several formerly monopolistic markets (telecommunication, electricity, gas, and railway) have been deregulated in Germany based on European directives and theoretically inspired by the theory of contestable markets. The original contestable market theory implied three assumptions necessary to be satisfied to establish potential competition: Free market entry, market exit possible without any costs, and the price adjustment lag exceeding the entry is shows that if the incumbent reduces its prices slowly (high adjustment lag) and the market entry can be performed quickly (low entry lag), a new competitor will be able to earn back sunk costs. Therefore it is not necessary that all three conditions are complied with for potential competition to exist. Applying this 'revised' contestable market theory to the deregulated sectors in Germany sections, natural monopolies can be identified in telecommunication local loops and local/regional connection networks, in the national electricity grid and the regional/local electricity distribution networks, in the national and regional/local gas transmission/distribution sections, and in the railroad network only. These sections are not contestable due to sunk costs, high entry lags expected and a probable short price adjustment lag. They are identified as bottlenecks which should be regulated. The function of system operators in energy and railroad are closely related to the non contestable monopolistic networks.
Medizin ; Recht
Combinatorial optimization is still one of the biggest mathematical challenges if you plan and organize the run-ning of a business. Especially if you organize potential factors or plan the scheduling and sequencing of opera-tions you will often be confronted with large-scaled combinatorial optimization problems. Furthermore it is very difficult to find global optima within legitimate time limits, because the computational effort of such problems rises exponentially with the problem size. Nowadays several approximation algorithms exist that are able to solve this kind of problems satisfactory. These algorithms belong to a special group of solution methods which are called local search algorithms. This article will introduce the topic of simulated annealing, one of the most efficient local search strategies. This article summarizes main aspects of the guest lecture Combinatorial Optimi-zation with Local Search Strategies, which was held at the University of Ioannina in Greece in June 1999.
Dieser Aufsatz wurde anlässlich eines Symposiums in einer Festschrift zu Ehren von Prof. Dr. Heinrich Reichmann veröffentlicht. Es geht um seine Verdienste im Bereich Electronic Government (E-Government) und Verwaltungsreform.
The aim of these lecture notes is to give a quick introduction into neural networks, its algorithms and applications. The notes are not intended as a replacement of a comprehensive textbook.