19 citations · 42 across the 7 of their papers we have counts for
8 papers
Maximizing electrical power supply using FACTS devices
Karsten Lehmann, Russell Bent, Feng Pan
Modern society critically depends on the services electric power provides. Power systems rely on a network of power lines and transformers to deliver power from sources of power (g…
The Complexity of Switching and FACTS Maximum-Potential-Flow Problems
Karsten Lehmann, Alban Grastien, Pascal Van Hentenryck
This papers considers the problem of maximizing the load that can be served by a power network. We use the commonly accepted Linear DC power network model and consider wo configura…
The Complexity of DC-Switching Problems
Karsten Lehmann, Alban Grastien, Pascal Van Hentenryck
This report provides a comprehensive complexity study of line switching in the Linear DC model for the feasibility problem and the optimization problems of maximizing the load that…
AC-Feasibility on Tree Networks is NP-Hard
Karsten Lehmann, Alban Grastien, Pascal Van Hentenryck
Recent years have witnessed significant interest in convex relaxations of the power flows, several papers showing that the second-order cone relaxation is tight for tree networks u…
How to Apply Assignment Methods that were Developed for Vehicular Traffic to Pedestrian Microsimulations
Vidal Roca, Vicente Torres, Tobias Kretz +2
Applying assignment methods to compute user-equilibrium route choice is very common in traffic planning. It is common sense that vehicular traffic arranges in a user-equilibrium ba…
Pedestrian Route Choice by Iterated Equilibrium Search
Tobias Kretz, Karsten Lehmann, Ingmar Hofsäß
In vehicular traffic planning it is a long standing problem how to assign demand such on the available model of a road network that an equilibrium with regard to travel time or gen…
Dynamic Assignment in Microsimulations of Pedestrians
Tobias Kretz, Karsten Lehmann, Ingmar Hofsäß +1
A generic method for dynamic assignment used with microsimulation of pedestrian dynamics is introduced. As pedestrians - unlike vehicles - do not move on a network, but on areas th…
User Equilibrium Route Assignment for Microscopic Pedestrian Simulation
Tobias Kretz, Karsten Lehmann, Ingmar Hofsäß
For the simulation of pedestrians a method is introduced to find routing alternatives from any origin position to a given destination area in a given geometry composed of walking a…