Frauke Liers
Orcid: 0000-0002-1671-0344Affiliations:
- 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:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Comput. Chem. Eng., 2024
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
2023
Eur. J. Oper. Res., November, 2023
INFORMS J. Optim., October, 2023
J. Optim. Theory Appl., June, 2023
INFORMS J. Comput., 2023
2022
Decision-support systems for ambulatory care, including pandemic requirements: using mathematically optimized solutions.
BMC Medical Informatics Decis. Mak., 2022
J. Optim. Theory Appl., 2022
Robust approximation of chance constrained DC optimal power flow under decision-dependent uncertainty.
Eur. J. Oper. Res., 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
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
2016
SIAM J. Optim., 2016
Math. Program., 2016
Discret. Optim., 2016
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016
2015
Math. Program. Comput., 2015
An exact solution method for quadratic matching: The one-quadratic-term technique and generalisations.
Discret. Optim., 2015
2013
Electron. Notes Discret. Math., 2013
2012
Comput. Optim. Appl., 2012
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
Proceedings of the Network Optimization - 5th International Conference, 2011
2010
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
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009
2008
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