Refine
Year of publication
Document Type
- Article (119)
- ZIB-Report (110)
- In Proceedings (38)
- Book chapter (34)
- Book (4)
- In Collection (4)
- Report (2)
- Master's Thesis (1)
Is part of the Bibliography
- no (312)
Keywords
- combinatorial optimization (4)
- integer programming (4)
- polyhedral combinatorics (4)
- BBAW (3)
- Dublin Core (3)
- Heuristics (3)
- Kooperativer Bibliotheksverbund Berlin-Brandenburg (3)
- Math-Net (3)
- column generation (3)
- polyhedra and polytopes (3)
- polynomial inequalities (3)
- Bibliotheksverbund (2)
- Harvest (2)
- Information System (2)
- Integer Programming (2)
- Internet services (2)
- KOBV (2)
- KOBV-Suchmaschine (2)
- Math-Net-Links (2)
- Online Optimization (2)
- Online-Optimierung (2)
- Open Access (2)
- Operations Research (2)
- RDF (2)
- Steiner tree (2)
- TSP (2)
- XML (2)
- distributed systems (2)
- elektronisches Publizieren (2)
- frequency assignment (2)
- line planning (2)
- online optimization (2)
- real-world problems (2)
- semi-algebraic sets (2)
- stability index (2)
- vehicle dispatching (2)
- öffentlicher Verkehr (2)
- ADAC (1)
- Algebraic Modelling Languages (1)
- Algorithmengeschichte (1)
- Algorithmus (1)
- Architektur der Suchmaschine (1)
- Asymmetric Travelling Salesman Problem (1)
- Aufzugssteuerung (1)
- Aufzugsteuerung (1)
- Automatic Storage System (1)
- Bibliothek der Zukunft (1)
- Branch&Cut-Algorithm (1)
- CEIC (1)
- Cellular Radio Telephone Systems (1)
- Column Generation (1)
- Combinatorial Auctions (1)
- Competitive Analysis (1)
- Constraint Shortest Paths Problem (1)
- Control of Stacker Cranes (1)
- Copyright (1)
- Cycles in Matroids (1)
- Discrete Mathematics (1)
- Diskrete Mathematik (1)
- Diskrete Optimierung (1)
- Dispatching von Fahrzeugen (1)
- Duty Scheduling (1)
- E-Learning (1)
- Echtzeit-Optimierung (1)
- Energy (1)
- FTTx, FTTH, FTTB, FTTC, FTTN, telecommunications, access networks, passive optical networks, network design, routing, energy efficiency (1)
- Facets (1)
- Frequency Assignment Problem (1)
- Frequenzplanung (1)
- GSM-Funknetze (1)
- Gemeinsamer Index (1)
- Gemischt-ganzzahlige Optimierung (1)
- George Dantzig (1)
- Hochschulbibliotheken (1)
- IMU (1)
- Integer Programs (1)
- KOBV-Projekt (1)
- Klassifikation (1)
- Kombinatorische Optimierung (1)
- Komplexität (1)
- Komplexitätstheorie (1)
- Kostenaufteilungsprobleme (1)
- Kürzeste Wege (1)
- Laserschweißen (1)
- MIP-Solver (1)
- Mathematics in Industry (1)
- Mathematik als Entscheidungshilfe (1)
- Mathematikunterricht in Schulen (1)
- Metadaten (1)
- Minimum-Cost Flow Problems (1)
- Mobilfunk (1)
- Modelling (1)
- Network Capacity Planning (1)
- OSPF Routing (1)
- Online Public Access Catalog (1)
- Online optimization (1)
- Online-Algorithm (1)
- Open Access Catalog (1)
- Optimierung (1)
- Optimization (1)
- P=NP (1)
- PCB Design (1)
- Packing (1)
- Produktionsfaktor Mathematik (1)
- Public transport (1)
- Publikations- und Kommunikationstechniken (1)
- Railway Slot Allocation (1)
- Realtime Optimization (1)
- Rundreisen (1)
- Shortest Path Routing (1)
- Spieltheorie (1)
- Steiner tree packing (1)
- Suchmaschine (1)
- Survey (1)
- Survivable Networks (1)
- Teaching (1)
- Telecommunication (1)
- Telecommunication Network Design (1)
- Telekommunikation (1)
- Telota (1)
- Telota-Projekt (1)
- Time Windows (1)
- Train Dispatching (1)
- Transportation (1)
- Transportation Systems (1)
- Traveling Salesman Problem (1)
- Travelling-Salesman-Problem (1)
- Verteilte Suche (1)
- Wahlverfahren und Mathematik (1)
- Wissenschaftsrat (1)
- World Digital Mathematics Library (1)
- applications in industry (1)
- applications of integer programming (1)
- applications to manufacturing (1)
- authentischer Mathematikunterricht (1)
- branch and bound (1)
- cardinality homogeneous set systems (1)
- chains (1)
- coloring (1)
- competitive analysis (1)
- competitiveness (1)
- computational complexity (1)
- cutting plane algorithm (1)
- cutting planes (1)
- digitale Bibliothek (1)
- digitale Information (1)
- digitale Informationstechnologie (1)
- digitale Informationsversorgung (1)
- discrete mathematics (1)
- discrete optimization (1)
- diskrete Mathematik (1)
- diskrete Optimierung (1)
- duty scheduling (1)
- dynamic programming (1)
- e-learning (1)
- electronic learning (1)
- elektronische Publikation (1)
- elektronisches Lehren und Lernen (1)
- elevator (1)
- elevator control (1)
- facets (1)
- ganzzahlige Programmierung (1)
- gas transport optimization (1)
- graph coloring (1)
- graph theory (1)
- greedy algorithm (1)
- hop constraints (1)
- industrial mathematics (1)
- kompetitive Analyse (1)
- mixed integer nonlinear programming (1)
- mixed-integer programs (1)
- mobile phone (1)
- operations research (1)
- optimale Tour (1)
- perfect graphs (1)
- placement (1)
- polyhedron (1)
- polytopes (1)
- pricing (1)
- public transit (1)
- public transportation (1)
- real world data (1)
- real-time (1)
- routing (1)
- routing in VLSI-design (1)
- semialgebraic sets (1)
- shortest paths (1)
- simulation studies (1)
- soft time windows (1)
- techniques of publishing and communication (1)
- telecommunication (1)
- transportation planning (1)
- traveling salesman problem (1)
- vehicle scheduling (1)
- wissenschaftliche Informationsversorgung (1)
- Öffentlicher Personenverkehr (1)
10 Jahre TELOTA
(2012)
Das TELOTA-Projekt - zunächst nur für zwei Jahre gestartet - feierte am 15. Juni 2011 sein 10-jähriges Bestehen im Rahmen eines Workshops mit einem abschließenden Festvortrag von Richard Stallmann zum Thema „Copyright versus community in the age of computer networks“. Diese Veranstaltung zeigte, wie aktuell die TELOTA-Themen weiterhin sind und dass diese eine große Resonanz in der allgemeinen Öffentlichkeit finden. Die TELOTA-Aktivitäten haben sich als wichtiger Bestandteil der IT-Infrastruktur der BBAW erwiesen, gehen aber weit über reinen Service hinaus. Sie beeinflussen die Forschung selbst und führen zu neuen interessanten wissenschaftlichen Fragestellungen. Der Rückblick auf die ersten zehn Jahre der TELOTA-Initiative in diesem Artikel soll einen kleinen Eindruck von dem geben, was bisher geleistet wurde.
10 Jahre TELOTA
(2012)
Das TELOTA-Projekt - zunächst nur für zwei Jahre gestartet - feierte am 15. Juni 2011 sein
10-jähriges Bestehen im Rahmen eines Workshops mit einem abschließenden Festvortrag von
Richard Stallmann zum Thema „Copyright versus community in the age of computer
networks“. Diese Veranstaltung zeigte, wie aktuell die TELOTA-Themen weiterhin sind und
dass diese eine große Resonanz in der allgemeinen Öffentlichkeit finden. Die TELOTA-Aktivitäten
haben sich als wichtiger Bestandteil der IT-Infrastruktur der BBAW erwiesen,
gehen aber weit über reinen Service hinaus. Sie beeinflussen die Forschung selbst und führen
zu neuen interessanten wissenschaftlichen Fragestellungen. Der Rückblick auf die ersten zehn
Jahre der TELOTA-Initiative in diesem Artikel soll einen kleinen Eindruck von dem geben,
was bisher geleistet wurde.
The line planning problem is one of the fundamental problems in strategic planning of public and rail transport. It consists in finding lines and corresponding frequencies in a transport network such that a given travel demand can be satisfied. There are (at least) two objectives. The transport company wishes to minimize operating costs, the passengers want to minimize travel times. We propose a n ew multi-commodity flow model for line planning. Its main features, in comparison to existing models, are that the passenger paths can be freely routed and that the lines are generated dynamically. We discuss properties of this model and investigate its complexity. Results with data for the city of Potsdam, Germany, are reported.
Natural gas is one of the most important energy sources in Germany and Europe. In recent years, political regulations have led to a strict separation of gas trading and gas transport, thereby assigning a central role in energy politics to the transportation and distribution of gas. These newly imposed political requirements influenced the technical processes of gas transport in such a way that the complex task of planning and operating gas networks has become even more intricate. Mathematically, the combination of discrete decisions on the configuration of a gas transport network, the nonlinear equations describing the physics of gas, and the uncertainty in demand and supply yield large-scale and highly complex stochastic mixed-integer nonlinear optimization problems. The Matheon project "Optimization of Gas Transport" takes the key role of making available the necessary core technology to solve the mathematical optimization problems which model the topology planning and the operation of gas networks. An important aspect of the academic impact is the free availability of our framework. As a result of several years of research and development, it is now possible to download a complete state-of-the-art framework for mixed-integer linear and nonlinear programming in source code at http://scip.zib.de