Lars Schewe

Orcid: 0000-0002-3778-262X

Affiliations:
  • University of Erlangen-Nuremberg, Department of Mathematics, Erlangen, Germany


According to our database1, Lars Schewe authored at least 38 papers between 2006 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
A tractable multi-leader multi-follower peak-load-pricing model with strategic interaction.
Math. Program., 2022

Exploiting complete linear descriptions for decentralized power market problems with integralities.
Math. Methods Oper. Res., 2022

Global optimization for the multilevel European gas market system with nonlinear flow models on trees.
J. Glob. Optim., 2022

Radius of Robust Feasibility for Mixed-Integer Problems.
INFORMS J. Comput., 2022

Robust market equilibria under uncertain cost.
Eur. J. Oper. Res., 2022

2021
Penalty alternating direction methods for mixed-integer optimal control with combinatorial constraints.
Math. Program., 2021

2020
A decomposition heuristic for mixed-integer supply chain problems.
Oper. Res. Lett., 2020

Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes.
Optim. Methods Softw., 2020

On electricity market equilibria with storage: Modeling, uniqueness, and a distributed ADMM.
Comput. Oper. Res., 2020

The impact of potential-based physics models on pricing in energy networks.
Central Eur. J. Oper. Res., 2020

Computing technical capacities in the European entry-exit gas market is NP-hard.
Ann. Oper. Res., 2020

Structural properties of feasible bookings in the European entry-exit gas market system.
4OR, 2020

2019
Algorithmic results for potential-based flows: Easy and hard cases.
Networks, 2019

Computing feasible points for binary MINLPs with MPECs.
Math. Program. Comput., 2019

A multilevel model of the European entry-exit gas market.
Math. Methods Oper. Res., 2019

Nonconvex equilibrium models for gas market analysis: Failure of standard techniques and alternative modeling approaches.
Eur. J. Oper. Res., 2019

Robust optimal discrete arc sizing for tree-shaped potential networks.
Comput. Optim. Appl., 2019

Optimierung von Versorgungsnetzen: Mathematische Modellierung und Lösungstechniken
Springer, ISBN: 978-3-662-58539-9, 2019

2018
Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods.
INFORMS J. Comput., 2018

Uniqueness and multiplicity of market equilibria on DC power flow networks.
Eur. J. Oper. Res., 2018

A system to evaluate gas network capacities: Concepts and implementation.
Eur. J. Oper. Res., 2018

2017
Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps.
SIAM J. Optim., 2017

Uniqueness of market equilibrium on a network: A peak-load pricing approach.
Eur. J. Oper. Res., 2017

GasLib - A Library of Gas Network Instances.
Data, 2017

2015
Validation of nominations in gas network optimization: models, methods, and solutions.
Optim. Methods Softw., 2015

Solving power-constrained gas transportation problems using an MIP-based alternating direction method.
Comput. Chem. Eng., 2015

Chapter 12: Computational results for validation of nominations.
Proceedings of the Evaluating Gas Network Capacities, 2015

Chapter 15: Perspectives.
Proceedings of the Evaluating Gas Network Capacities, 2015

Chapter 6: The MILP-relaxation approach.
Proceedings of the Evaluating Gas Network Capacities, 2015

Chapter 5: Mathematical optimization for evaluating gas network capacities.
Proceedings of the Evaluating Gas Network Capacities, 2015

2013
More bounds on the diameters of convex polytopes.
Optim. Methods Softw., 2013

On the finite set of missing geometric configurations (<i>n</i><sub>4</sub>).
Comput. Geom., 2013

2011
Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets.
Exp. Math., 2011

Pushing the boundaries of polytopal realizability.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
The coolest path problem.
Networks Heterog. Media, 2010

Nonrealizable Minimal Vertex Triangulations of Surfaces: Showing Nonrealizability Using Oriented Matroids and Satisfiability Solvers.
Discret. Comput. Geom., 2010

2009
Topological configurations (n<sub>4</sub>) exist for all n>=17.
Eur. J. Comb., 2009

2006
Generation of Oriented Matroids Using Satisfiability Solvers.
Proceedings of the Mathematical Software, 2006


  Loading...