Refine
Year of publication
Document Type
- ZIB-Report (103)
- Article (72)
- In Proceedings (30)
- Book chapter (13)
- ZIB-Annual (4)
- Other (4)
- In Collection (3)
- Book (2)
- Doctoral Thesis (2)
- Report (2)
Keywords
- Mixed Integer Programming (10)
- Integer Programming (6)
- IP (5)
- branch-and-cut (5)
- linear programming (5)
- mixed integer programming (5)
- Open Access (4)
- UMTS (4)
- branch-and-bound (4)
- mixed-integer programming (4)
- parallelization (4)
- MIP (3)
- energy system models (3)
- maximum-weight connected subgraph (3)
- mixed-integer linear programming (3)
- mixed-integer semidefinite programming (3)
- optimization software (3)
- preprocessing (3)
- presolving (3)
- Branch-and-Bound (2)
- Branch-and-cut (2)
- Branch-and-price (2)
- Column generation (2)
- Constraint integer programming (2)
- Jahresbericht (2)
- KOBV (2)
- Linear programming (2)
- MIPLIB (2)
- Mixed-Integer Programming (2)
- Mixed-integer linear programming (2)
- Mixed-integer nonlinear programming (2)
- Mixed-integer semidefinite programming (2)
- Network design (2)
- Optimization (2)
- Optimization solver (2)
- ParaSCIP (2)
- Parallelization (2)
- Steiner tree (2)
- Steiner tree optimization (2)
- Steiner tree packing (2)
- Steiner tree problems (2)
- Sudoku (2)
- Ubiquity Generator Framework (2)
- block structure (2)
- branch-and-price (2)
- chip verification (2)
- column generation framework (2)
- constraint integer programming (2)
- constraint programming (2)
- cut selection (2)
- high performance computing (2)
- integer programming (2)
- interior-point method (2)
- maximum-weight connected subgraph problem (2)
- mixed-integer nonlinear programming (2)
- optimization solver (2)
- prize-collecting Steiner tree problem (2)
- 2-dim Cutting Stock Problem (1)
- Algebraic Modelling Languages (1)
- Bibliotheken (1)
- Branch-And-Cut (1)
- Branch-and-Cut (1)
- Branching Rules (1)
- Buchungsvalidierung (1)
- CO2 Transport (1)
- Chipverifikation (1)
- Combinatorial Optimization (1)
- Constraint Integer Programming (1)
- Constraint Programming (1)
- Container Terminal (1)
- DIMACS Challenge (1)
- DeepGreen (1)
- Distributed Memory (1)
- Dokumentenspeicherung (1)
- Energiewende (1)
- Entry-Exit Model (1)
- Facility Location (1)
- Functional autoregressive (1)
- Ganzzahlige Programmierung (1)
- Gas Distribution Networks (1)
- Gas Market Liberalization (1)
- Gas Network Access Regulation (1)
- Gasnetzplanung (1)
- General Public (1)
- Hierarchical Networks (1)
- Hybrid model (1)
- Hydrogen Infrastructure (1)
- Hydrogen Transport (1)
- IST-20 (1)
- Instances (1)
- Intermediate Storage Area (1)
- Internet routing (1)
- Investment planning (1)
- LP (1)
- LP solver (1)
- LP, MIP, CIP, MINLP, modeling, optimization, SCIP, SoPlex, Zimpl (1)
- Lagrangian Relaxation (1)
- Landside operation (1)
- Linear Programming (1)
- Location Planning in Telecommunications (1)
- MINLP solver (1)
- MIP solver (1)
- MIP-Solver (1)
- MIPLIB2003 (1)
- MOMENTUM (1)
- Mathematical Optimization (1)
- Mathematical Programming (1)
- Mathematical Programming Testdata Library (1)
- Maximum Diversity Problem (1)
- Metadaten (1)
- Mixed Integer Programming, Parallel processing, Node merging, Racing, ParaSCIP, Ubiquity Generator Framework, MIPLIB (1)
- Mixed-Integer Nonlinear Nonconvex Stochastic Optimization (1)
- Mixed-integer programming (1)
- Mixed-integer-programming (1)
- Modelling (1)
- Modelling Language (1)
- Modelling Languages (1)
- Modelling language (1)
- Multi-energy systems (1)
- Natural gas flow forecasting (1)
- Netlib (1)
- Network Design (1)
- Network Flows (1)
- Network planning (1)
- Neural network (1)
- Node merging (1)
- Nominierungsvalidierung (1)
- Open-Access-Transformation (1)
- Optimierungssoftware (1)
- PCB Design (1)
- Parallel Computing (1)
- Parallel processing (1)
- Pipeline Sizing (1)
- Problem Instances (1)
- Pseudocost Branching (1)
- Pseudocost-Branching (1)
- Questionnaire (1)
- Racing ParaSCIP (1)
- Radio Network Planning (1)
- Realistic Data (1)
- Reliability-Branching (1)
- Repositorien (1)
- SCIP, MIP, MINLP, CIP, LP, modeling, optimization (1)
- SCIP-Jack (1)
- Simplex (1)
- Simulation (1)
- Steiner Tree Packing in Graphs (1)
- Steiner Tree Problem (1)
- Steiner Trees (1)
- Steiner connectivity (1)
- Steiner tree problem (1)
- Steiner tree solver (1)
- Steiner tree variants (1)
- Storage space allocation (1)
- Strong-Branching (1)
- Supercomputer (1)
- Teaching (1)
- Technische Kapazitäten (1)
- Telecommunication (1)
- Topologieplanung (1)
- Topology Planning (1)
- Traffic enineering (1)
- Unit commitment (1)
- Variable selection (1)
- Verlage (1)
- XML (1)
- Yard crane scheduling (1)
- Zimpl (1)
- Zweitveröffentlichung (1)
- Zählen (1)
- adaptive search behavior (1)
- anlalytic center (1)
- branch-cut-and-price framework (1)
- configuration (1)
- counting (1)
- cutting plane selection (1)
- entry-exit model (1)
- exact computation (1)
- freely allocable capacity (1)
- ganzzahlige Programme (1)
- gas network optimization (1)
- gas transport optimization (1)
- generic column generation (1)
- graph transformation (1)
- grid graphs (1)
- high-performance computing (1)
- interior-point methods (1)
- large-scale mixed-integer nonlinear programming (1)
- massive parallization (1)
- mathematical model (1)
- mixed integer nonlinear programming (1)
- mixed-integer linear and nonlinear programming (1)
- modeling (1)
- multi-criteria optimization (1)
- network planning (1)
- operations research in energy (1)
- optimality prediction (1)
- parallel branch-and-bound (1)
- parallel computing (1)
- perfect power control (1)
- placement (1)
- prize-collecting Steiner tree (1)
- radio interface (1)
- rational arithmetic (1)
- reduction techniques (1)
- reinforcement learning (1)
- routing (1)
- simplex method (1)
- supercomputing (1)
- supply chain management, supply network optimization, mixed-integer linear programming, primal heuristics, numerical stability, large-scale optimization (1)
- variable selection (1)
Institute
- Mathematical Optimization (120)
- Applied Algorithmic Intelligence Methods (67)
- Mathematical Optimization Methods (45)
- ZIB Allgemein (22)
- Mathematical Algorithmic Intelligence (18)
- Digital Data and Information for Society, Science, and Culture (10)
- Energy Network Optimization (7)
- AI in Society, Science, and Technology (6)
- KOBV (4)
Ende Juni diesen Jahres wurde das Gigabit-Wissenschaftsnetz offiziell gestartet. In der zweijährigen Vorbereitungsphase wurden nicht nur die technischen Möglichkeiten der neuen Übertragungstechniken und Dienste getestet. Es wurden auch verschiedene Fragestellungen zum effizienten Einsatz der verfügbaren Ressourcen für den Betrieb des G-WiN untersucht. In diesem Artikel beschreiben wir, wie das G-WiN zu seiner jetzigen Struktur und Topologie gekommen ist.
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.
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.
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.
ZIMPL User Guide
(2001)
The thesis deals with the implementation and application of out-of-the-box tools in linear and mixed integer programming. It documents the lessons learned and conclusions drawn from five years of implementing, maintaining, extending, and using several computer codes to solve real-life industrial problems. By means of several examples it is demonstrated how to apply algebraic modeling languages to rapidly devise mathematical models of real-world problems. It is shown that today's MIP solvers are capable of solving the resulting mixed integer programs, leading to an approach that delivers results very quickly. Even though, problems are tackled that not long ago required the implementation of specialized branch-and-cut algorithms. In the first part of the thesis the modeling language Zimpl is introduced. Chapter 2 contains a complete description of the language. In the subsequent chapter details of the implementation are described. Both theoretical and practical considerations are discussed. Aspects of software engineering, error prevention, and detection are addressed. In the second part several real-world projects are examined that employed the methodology and the tools developed in the first part. Chapter 4 presents three projects from the telecommunication industry dealing with facility location problems. Chapter 5 characterizes questions that arise in UMTS planning. Problems, models, and solutions are discussed. Special emphasis is put on the dependency of the precision of the input data and the results. Possible reasons for unexpected and undesirable solutions are explained. Finally, the Steiner tree packing problem in graphs, a well-known hard combinatorial problem, is revisited. A formerly known, but not yet used model is applied to combine switchbox wire routing and via minimization. All instances known from the literature are solved by this approach, as are some newly generated bigger problem instances.
This paper describes several experiments to explore the options for solving a class of mixed integer nonlinear programming problems that stem from a real-world mine production planning project. The only type of nonlinear constraints in these problems are bilinear equalities involving continuous variables, which enforce the ratios between elements in mixed material streams. A branch-and-bound algorithm to handle the integer variables has been tried in another project. However, this branch-and-bound algorithm is not effective for handling the nonlinear constraints. Therefore state-of-the-art nonlinear solvers are utilized to solve the resulting nonlinear subproblems in this work. The experiments were carried out using the NEOS server for optimization. After finding that current nonlinear programming solvers seem to lack suitable preprocessing capabilities, we preprocess the instances beforehand and use an heuristic approach to solve the nonlinear subproblems. In the appendix, we explain how to add a polynomial constraint handler that uses IPOPT as embedded nonlinear programming solver for the constraint programming framework SCIP. This is one of the crucial steps for implementing our algorithm in SCIP. We briefly described our approach and give an idea of the work involved.
In this article, strategical infrastructure planning problems in the design of large-scale telecommunication networks are discussed based on experiences from three projects with industrial partners: The access network planning of the German Gigabit-Wissenschaftsnetz (G-WiN) for DFN (Verein zur Förderung eines Deutschen Forschungsnetzes e.V.), the mobile network switching center location planning project for E-Plus Mobilfunk, and the fixed network switching center location planning project for TELEKOM AUSTRIA. We introduce a mathematical model for a hierarchical multi-commodity capacitated facility location problem, present adaptions of this basic model to the specific requirements within the different projects and discuss the individual peculiarities and model decisions made. Eventually, we present and discuss computational results of three associated case studies, illustrating '"how we did the job`` with mathematical methods.
The final NETLIB-LP results
(2003)
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.
We present publicly available data sets related to research on wireless networks. The scenarios contain a wide range of data and are detailed in all aspects. To our knowledge, this is the most realistic, comprehensive, and detailed \emph{public} data collection on mobile networking. We indicate example uses of this data collection in applications related tu UMTS.