• Deutsch
Login

  • Home
  • Search
  • Browse
  • Publish
  • FAQ

Refine

Author

  • Koch, Thorsten (189)
  • Martin, Alexander (34)
  • Rehfeldt, Daniel (31)
  • Shinano, Yuji (29)
  • Achterberg, Tobias (25)
  • Berthold, Timo (23)
  • Gleixner, Ambros (21)
  • Heinz, Stefan (18)
  • Gamrath, Gerald (17)
  • Fügenschuh, Armin (16)
+ more

Year of publication

  • 2021 (5)
  • 2020 (22)
  • 2019 (13)
  • 2018 (13)
  • 2017 (11)
  • 2016 (13)
  • 2015 (11)
  • 2014 (5)
  • 2013 (11)
  • 2012 (12)
+ more

Document Type

  • ZIB-Report (89)
  • Article (47)
  • In Proceedings (23)
  • Book chapter (12)
  • In Collection (3)
  • Other (3)
  • ZIB-Annual (2)
  • Book (2)
  • Doctoral Thesis (2)
  • Proceedings (2)
+ more

Language

  • English (173)
  • German (13)
  • Japanese (3)

Has Fulltext

  • no (98)
  • yes (91)

Is part of the Bibliography

  • no (187)
  • yes (2)

Keywords

  • Mixed Integer Programming (10)
  • Integer Programming (6)
  • IP (5)
  • branch-and-cut (5)
  • linear programming (5)
  • mixed integer programming (5)
  • UMTS (4)
  • branch-and-bound (4)
  • parallelization (4)
  • MIP (3)
+ more

Institute

  • Mathematical Optimization (119)
  • Mathematical Optimization Methods (45)
  • Applied Algorithmic Intelligence Methods (23)
  • ZIB Allgemein (22)
  • Mathematical Algorithmic Intelligence (12)
  • Digital Data and Information for Society, Science, and Culture (7)
  • Energy Network Optimization (6)
  • KOBV (3)

189 search hits

  • 1 to 10
  • BibTeX
  • CSV
  • RIS
  • XML
  • 10
  • 20
  • 50
  • 100

Sort by

  • Year
  • Year
  • Title
  • Title
  • Author
  • Author
Solving Steiner Tree Problems in Graphs to Optimality (1996)
Koch, Thorsten ; Martin, Alexander
In this paper we present the implementation of a branch-and-cut algorithm for solving Steiner tree problems in graphs. Our algorithm is based on an integer programming formulation for directed graphs and comprises preprocessing, separation algorithms and primal heuristics. We are able to solve all problem instances discussed in literature to optimality, including one to our knowledge not yet solved problem. We also report on our computational experiences with some very large Steiner tree problems arising from the design of electronic circuits. All test problems are gathered in a newly introduced library called {\em SteinLib} that is accessible via World Wide Web.
Integer programming approaches to access and backbone IP-network planning (2002)
Bley, Andreas ; Koch, Thorsten
In this article we study the problem of designing a nation-wide communication network. Such networks usually consist of an access layer, a backbone layer, and maybe several intermediate layers. The nodes of each layer must be connected to those of the next layer in a tree-like fashion. The backbone layer has to satisfy certain survivability and routing constraints. Given the node locations, the demands between them, the possible connections and hardware configurations, and various other technical and administrational constraints, the goal is to decide, which node is assigned to which network level, how the nodes are connected, what hardware must be installed, and how traffic is routed in the backbone. Mixed integer linear programming models and solution methods are presented for both the access and the backbone network design problem. The focus is on the design of IP-over-SDH networks, but the access network design model and large parts of the backbone network design models are general and also applicable for other types of communication networks. Results obtained with these methods in the planning of the German research network are presented.
Modelling Feasible Network Configurations for UMTS (2002)
Eisenblätter, Andreas ; Fügenschuh, Armin ; Koch, Thorsten ; Koster, Arie M.C.A. ; Martin, Alexander ; Pfender, Tobias ; Wegel, Oliver ; Wessäly, Roland
A model for the optimisation of the location and configuration of base stations in a UMTS network is described. The focus is primarily on modelling the configuration problem sufficiently accurate using mixed-integer variables and (essentially) linear constraints. These constraints reflect the limited downlink code capacity in each cell, the interference limitations for successful up- and downlink transmissions, the need for sufficiently strong (cell) pilot signals, and the potential gain for mobiles from being in soft(er) hand-over. It is also explained how to use the model as a basis for rating network configurations.
The final NETLIB-LP results (2003)
Koch, Thorsten
The NETLIB has now served for 18 years as a repository of LP problem instances. From the beginning to the present day there was some uncertainness about the precise values of the optimal solutions. We implemented a program using exact rational arithmetic to compute proofs for the feasibility and optimality of an LP solution. This paper reports the \emph{exact} optimal objective values for all NETLIB problems.
Branching on History Information (2002)
Achterberg, Tobias ; Koch, Thorsten ; Martin, Alexander
Mixed integer programs ($MIPs$) are commonly solved with branch and bound algorithms based on linear programming. The success and the speed of the algorithm strongly depends on the strategy used to select the branching variables. Today's state-of-the-art strategy is called \emph{pseudocost branching} and uses information of previous branchings to determine the current branching. We propose a modification of \emph{pseudocost branching} which we call \emph{history branching}. This strategy has been implemented in $SIP$, a state-of-the-art $MIP$ solver. We give computational results that show the superiority of the new strategy.
Verteilter Dokumenten-Speicher, Erfahrungen mit den Kluwer-Daten des Friedrich-Althoff-Konsortiums (2003)
Koch, Thorsten
Dieser Bericht beschreibt die Erfahrungen und Schlussfolgerungen,die im Rahmen der VDS-Vorstudie bei der Speicherung der vom Friedrich-Althoff-Konsortium lizenzierten Zeitschriften des Kluwer-Verlages gewonnen wurden.
Large-scale hierarchical networks: How to compute an optimal architecture? (2004)
Bley, Andreas ; Koch, Thorsten ; Wessäly, Roland
In this article, we present a mathematical model and an algorithm to support one of the central strategic planning decisions of network operators: How to organize a large number of locations into a hierarchical network? We propose a solution approach that is based on mixed-integer programming and Lagrangian relaxation techniques. As major advantage, our approach provides not only solutions but also worst-case quality guarantees. Real-world scenarios with more than 750 locations have been solved within 30 minutes to less than 1\% off optimality.
Optimization Methods for UMTS Radio Network Planning (2003)
Eisenblätter, Andreas ; Fügenschuh, Armin ; Geerdes, Hans-Florian ; Junglas, Daniel ; Koch, Thorsten ; Martin, Alexander
The UMTS radio network planning problem poses the challenge of designing a cost-effective network that provides users with sufficient coverage and capacity. We describe an optimization model for this problem that is based on comprehensive planning data of the EU project MOMENTUM. We present heuristic mathematical methods for this realistic model, including computational results.
MIPLIB 2003 (2005)
Achterberg, Tobias ; Koch, Thorsten ; Martin, Alexander
This paper reports on the fourth version of the Mixed Integer Programming Library. Since ({\sc miplib}) is to provide a concise set of challenging problems, it became necessary to purge instances that became too easy. We present an overview of the 27 new problems and statistical data for all 60 instances.
SteinLib: An Updated Library on Steiner Tree Problems in Graphs (2000)
Koch, Thorsten ; Martin, Alexander ; Voß, Stefan
In this paper we present the {\em SteinLib}, a library of data sets for the Steiner tree problem in graphs. This library extends former libraries on Steiner tree problems by many new interesting and difficult instances, most of them arising from real-world applications. We give a survey on the difficulty of these problem instances by giving references to state-of-the-art software packages that were the first or are currently among the best to solve these instances.
  • 1 to 10

OPUS4 Logo

  • Contact
  • Impressum und Datenschutz
  • Sitelinks