Frauke Liers

Orcid: 0000-0002-1671-0344

Affiliations:
  • Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany


According to our database1, Frauke Liers authored at least 48 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The non-stop disjoint trajectories problem.
Discret. Optim., 2024

Fleet & tail assignment under uncertainty.
Discret. Optim., 2024

Quality control in particle precipitation via robust optimization.
Comput. Chem. Eng., 2024

A Framework for Data-Driven Explainability in Mathematical Optimization.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Optimizing integrated aircraft assignment and turnaround handling.
Eur. J. Oper. Res., November, 2023

Data-Driven Distributionally Robust Optimization over Time.
INFORMS J. Optim., October, 2023

Improving Quantum Computation by Optimized Qubit Routing.
J. Optim. Theory Appl., June, 2023

Solving AC Optimal Power Flow with Discrete Decisions to Global Optimality.
INFORMS J. Comput., 2023

2022
Affinely Adjustable Robust Linear Complementarity Problems.
SIAM J. Optim., 2022

Special issue on Energy Networks.
Math. Methods Oper. Res., 2022

Decision-support systems for ambulatory care, including pandemic requirements: using mathematically optimized solutions.
BMC Medical Informatics Decis. Mak., 2022

Outer Approximation for Mixed-Integer Nonlinear Robust Optimization.
J. Optim. Theory Appl., 2022

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

Adaptive Bundle Methods for Nonlinear Robust Optimization.
INFORMS J. Comput., 2022

A rolling-horizon approach for multi-period optimization.
Eur. J. Oper. Res., 2022

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

Robust approximation of chance constrained DC optimal power flow under decision-dependent uncertainty.
Eur. J. Oper. Res., 2022

Robust static and dynamic maximum flows.
CoRR, 2022

Robust optimization in nanoparticle technology: A proof of principle by quantum dot growth in a residence time reactor.
Comput. Chem. Eng., 2022

Towards the Solution of Robust Gas Network Optimization Problems Using the Constrained Active Signature Method.
Proceedings of the 10th International Network Optimization Conference, 2022

2021
Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks.
J. Glob. Optim., 2021

Network Planning and Routing Problems over Time: Models, Complexity and Algorithms (Invited Talk).
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Dynamic Sectorization in Multi-Panel Massive MIMO Systems.
Proceedings of the 4th IEEE 5G World Forum, 2021

2020
Global optimization of batch and steady-state recycling chromatography based on the equilibrium model.
Comput. Chem. Eng., 2020

2019
Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches.
Optim. Methods Softw., 2019

Decomposable robust two-stage optimization: An application to gas network operations under uncertainty.
Networks, 2019

2018
Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations.
SIAM J. Optim., 2018

Robust flows over time: models and complexity results.
Math. Program., 2018

2016
Structural Investigation of Piecewise Linearized Network Flow Problems.
SIAM J. Optim., 2016

Single-commodity robust network design with finite and Hose demand sets.
Math. Program., 2016

Binary Steiner trees: Structural results and an exact solution approach.
Discret. Optim., 2016

Crossing Minimization in Storyline Visualization.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

2015
Solving network design problems via iterative aggregation.
Math. Program. Comput., 2015

An exact solution method for quadratic matching: The one-quadratic-term technique and generalisations.
Discret. Optim., 2015

2013
A polyhedral study of the Hamiltonian p-median problem.
Electron. Notes Discret. Math., 2013

2012
Partitioning planar graphs: a fast combinatorial approach for max-cut.
Comput. Optim. Appl., 2012

Models and Algorithms for Robust Network Design with Several Traffic Scenarios.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
Simplifying maximum flow computations: The effect of shrinking and good initial flows.
Discret. Appl. Math., 2011

A branch-and-cut algorithm based on semidefinite programming for the minimum <i>k</i>-partition problem.
Ann. Oper. Res., 2011

An Exact Algorithm for Robust Network Design.
Proceedings of the Network Optimization - 5th International Conference, 2011

2010
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization.
Math. Program., 2010

A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions.
J. Comb. Optim., 2010

Exact Bipartite Crossing Minimization under Tree Constraints.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009
A Simple MAX-CUT Algorithm for Planar Graphs.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Local cuts revisited.
Oper. Res. Lett., 2008

A Basic Toolbox for Constrained Quadratic 0/1 Optimization.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

2007
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem.
Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

2004
Contributions to Determining Exact Ground-States of Ising Spin-Glasses and to their Physics
PhD thesis, 2004


  Loading...