Share This Author
GasLib - A Library of Gas Network Instances
The goal of GasLib is to provide a set of publicly available gas network instances that can be used by researchers in the field of gas transport to save time and compare different models and algorithms on the same specified test sets.
Evaluating Gas Network Capacities
- T. Koch, Benjamin Hiller, M. Pfetsch, L. Schewe
- EconomicsMOS-SIAM Series on Optimization
- 17 March 2015
Evaluating Gas Network Capacities provides an introduction to the field of gas transportation planning and discusses in detail the advantages and disadvantages of several mathematical models that address gas transport within the context of the technical and regulatory framework.
Using Piecewise Linear Functions for Solving MINLP s
This chapter wants to demonstrate that in certain cases general mixed integer nonlinear programs (MINLPs) can be solved by just applying purely techniques from the mixed integer linear world, and to approximate the nonlinearities by piecewise linear functions.
Validation of nominations in gas network optimization: models, methods, and solutions
This article investigates methods to solve a fundamental task in gas transportation, namely the validation of nomination problem, and describes a two-stage approach to solve the resulting complex and numerically difficult nonconvex mixedinteger nonlinear feasibility problem.
A New Algorithm for MINLP Applied to Gas Transport Energy Cost Minimization
A new algorithm for the solution of nonconvex mixed-integer nonlinear optimization problems together with an application from gas network optimization, the gas transport energy cost minimization problem, which is to transport gas through the network at minimum operating cost.
Nonrealizable Minimal Vertex Triangulations of Surfaces: Showing Nonrealizability Using Oriented Matroids and Satisfiability Solvers
- L. Schewe
- MathematicsDiscret. Comput. Geom.
- 16 January 2008
The first infinite family of such nonrealizable triangulations of surfaces is constructed by transforming the problem of finding suitable oriented matroids into a satisfiability problem and can be applied to other geometric realizability problems, e.g., for face lattices of polytopes.
Radius of Robust Feasibility for Mixed-Integer Problems
For a mixed-integer linear problem (MIP) with uncertain constraints, the radius of robust feasibility (RRF) determines a value for the maximal size of the uncertainty set such that robust feasibility…
Solving power-constrained gas transportation problems using an MIP-based alternating direction method
Mathematical optimization for challenging network planning problems in unbundled liberalized gas markets
The main goal of the research is to develop a numerical solver that is able to solve instances of realistic size of gas network operators, and the main ingredients of the prototypical software implementations are described.