default search action
Frauke Liers
Person information
- affiliation: Friedrich-Alexander-Universität Erlangen-Nürnberg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j35]Martina Kuchlbauer
, Jana Dienstbier, Adeel Muneer, Hanna Hedges, Michael Stingl
Quality control in particle precipitation via robust optimization. Comput. Chem. Eng. 183: 108619 (2024) - [j34]Lukas Glomb
Fleet & tail assignment under uncertainty. Discret. Optim. 52: 100836 (2024) - [j33]Benno Hoch
The non-stop disjoint trajectories problem. Discret. Optim. 52: 100837 (2024) - [c12]Kevin-Martin Aigner, Marc Goerigk, Michael Hartisch
A Framework for Data-Driven Explainability in Mathematical Optimization. AAAI 2024: 20912-20920 - 2023
- [j32]Lukas Glomb
Optimizing integrated aircraft assignment and turnaround handling. Eur. J. Oper. Res. 310(3): 1051-1071 (2023) - [j31]Kevin-Martin Aigner
Solving AC Optimal Power Flow with Discrete Decisions to Global Optimality. INFORMS J. Comput. 35(2): 458-474 (2023) - [j30]Kevin-Martin Aigner
Data-Driven Distributionally Robust Optimization over Time. INFORMS J. Optim. 5(4): 376-394 (2023) - [j29]Friedrich Wagner
Improving Quantum Computation by Optimized Qubit Routing. J. Optim. Theory Appl. 197(3): 1161-1194 (2023) - [i4]Kevin-Martin Aigner, Marc Goerigk, Michael Hartisch, Frauke Liers, Arthur Miehlich:
A Framework for Data-Driven Explainability in Mathematical Optimization. CoRR abs/2308.08309 (2023) - 2022
- [j28]Jana Dienstbier, Kevin-Martin Aigner, Jan Rolfes
Robust optimization in nanoparticle technology: A proof of principle by quantum dot growth in a residence time reactor. Comput. Chem. Eng. 157: 107618 (2022) - [j27]Lukas Glomb, Frauke Liers
A rolling-horizon approach for multi-period optimization. Eur. J. Oper. Res. 300(1): 189-206 (2022) - [j26]Kevin-Martin Aigner
Robust approximation of chance constrained DC optimal power flow under decision-dependent uncertainty. Eur. J. Oper. Res. 301(1): 318-333 (2022) - [j25]Christian Biefel
Robust market equilibria under uncertain cost. Eur. J. Oper. Res. 302(3): 1230-1241 (2022) - [j24]Frauke Liers
Radius of Robust Feasibility for Mixed-Integer Problems. INFORMS J. Comput. 34(1): 243-261 (2022) - [j23]Martina Kuchlbauer
Adaptive Bundle Methods for Nonlinear Robust Optimization. INFORMS J. Comput. 34(4): 2106-2124 (2022) - [j22]Martina Kuchlbauer
Outer Approximation for Mixed-Integer Nonlinear Robust Optimization. J. Optim. Theory Appl. 195(3): 1056-1086 (2022) - [j21]Neele Leithäuser, Dennis Adelhütte
Decision-support systems for ambulatory care, including pandemic requirements: using mathematically optimized solutions. BMC Medical Informatics Decis. Mak. 22(1): 132 (2022) - [j20]Miguel F. Anjos, Falk M. Hante, Frauke Liers
Special issue on Energy Networks. Math. Methods Oper. Res. 95(3): 361-363 (2022) - [j19]Christian Biefel
Affinely Adjustable Robust Linear Complementarity Problems. SIAM J. Optim. 32(1): 152-172 (2022) - [c11]Timo Kreimeier, Martina Kuchlbauer, Frauke Liers, Michael Stingl, Andrea Walther:
Towards the Solution of Robust Gas Network Optimization Problems Using the Constrained Active Signature Method. INOC 2022: 1-6 - [i3]Christian Biefel, Martina Kuchlbauer, Frauke Liers, Lisa Waldmüller:
Robust static and dynamic maximum flows. CoRR abs/2202.10880 (2022) - 2021
- [j18]Frauke Liers
Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks. J. Glob. Optim. 80(2): 307-340 (2021) - [c10]André Antunovic, Ebrahim Amiri, Christian Biefel, Gerhard Steinböck, Jocelyn Aulin, Frauke Liers
Dynamic Sectorization in Multi-Panel Massive MIMO Systems. 5GWF 2021: 70-75 - [c9]Lukas Glomb, Benno Hoch, Frauke Liers
Network Planning and Routing Problems over Time: Models, Complexity and Algorithms (Invited Talk). ESA 2021: 1:1-1:3 - 2020
- [j17]Jana Dienstbier, Johannes Schmölder, Robert Burlacu
Global optimization of batch and steady-state recycling chromatography based on the equilibrium model. Comput. Chem. Eng. 135: 106687 (2020)
2010 – 2019
- 2019
- [j16]Denis Aßmann
Decomposable robust two-stage optimization: An application to gas network operations under uncertainty. Networks 74(1): 40-61 (2019) - [j15]Veronika Grimm, Thomas Kleinert, Frauke Liers
Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches. Optim. Methods Softw. 34(2): 406-436 (2019) - 2018
- [j14]Corinna Gottschalk
Robust flows over time: models and complexity results. Math. Program. 171(1-2): 55-85 (2018) - [j13]Denis Aßmann
Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations. SIAM J. Optim. 28(3): 2489-2517 (2018) - 2016
- [j12]Frauke Liers
Binary Steiner trees: Structural results and an exact solution approach. Discret. Optim. 21: 85-117 (2016) - [j11]Valentina Cacchiani
Single-commodity robust network design with finite and Hose demand sets. Math. Program. 157(1): 297-342 (2016) - [j10]Frauke Liers
Structural Investigation of Piecewise Linearized Network Flow Problems. SIAM J. Optim. 26(4): 2863-2886 (2016) - [c8]Martin Gronemann, Michael Jünger, Frauke Liers
Crossing Minimization in Storyline Visualization. GD 2016: 367-381 - [i2]Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers, Britta Peis, Daniel Schmand, Andreas Wierz:
Robust Flows over Time: Models and Complexity Results. CoRR abs/1608.06520 (2016) - [i1]Martin Gronemann, Michael Jünger, Frauke Liers, Francesco Mambelli:
Crossing Minimization in Storyline Visualization. CoRR abs/1608.08027 (2016) - 2015
- [j9]Lena Hupp, Laura Klein, Frauke Liers
An exact solution method for quadratic matching: The one-quadratic-term technique and generalisations. Discret. Optim. 18: 193-216 (2015) - [j8]Andreas Bärmann, Frauke Liers
Solving network design problems via iterative aggregation. Math. Program. Comput. 7(2): 189-217 (2015) - 2013
- [j7]Lena Hupp, Frauke Liers
A polyhedral study of the Hamiltonian p-median problem. Electron. Notes Discret. Math. 41: 213-220 (2013) - 2012
- [j6]Frauke Liers
Partitioning planar graphs: a fast combinatorial approach for max-cut. Comput. Optim. Appl. 51(1): 323-344 (2012) - [c7]Eduardo Álvarez-Miranda
Models and Algorithms for Robust Network Design with Several Traffic Scenarios. ISCO 2012: 261-272 - 2011
- [j5]Bissan Ghaddar
A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem. Ann. Oper. Res. 188(1): 155-174 (2011) - [j4]Frauke Liers
Simplifying maximum flow computations: The effect of shrinking and good initial flows. Discret. Appl. Math. 159(17): 2187-2203 (2011) - [c6]Christoph Buchheim
An Exact Algorithm for Robust Network Design. INOC 2011: 7-17 - 2010
- [j3]Diana Fanghänel, Frauke Liers
A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions. J. Comb. Optim. 19(3): 369-393 (2010) - [j2]Christoph Buchheim
Speeding up IP-based algorithms for constrained quadratic 0-1 optimization. Math. Program. 124(1-2): 513-535 (2010) - [c5]Frank Baumann, Christoph Buchheim, Frauke Liers:
Exact Bipartite Crossing Minimization under Tree Constraints. CTW 2010: 17-20 - [c4]Frank Baumann, Christoph Buchheim
Exact Bipartite Crossing Minimization under Tree Constraints. SEA 2010: 118-128
2000 – 2009
- 2009
- [c3]Frauke Liers, G. Pardella:
A Simple MAX-CUT Algorithm for Planar Graphs. CTW 2009: 351-354 - 2008
- [j1]Christoph Buchheim
Local cuts revisited. Oper. Res. Lett. 36(4): 430-433 (2008) - [c2]Christoph Buchheim
A Basic Toolbox for Constrained Quadratic 0/1 Optimization. WEA 2008: 249-262 - 2007
- [c1]Markus Behle, Michael Jünger, Frauke Liers
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. WEA 2007: 379-392 - 2004
- [b1]Frauke Liers:
Contributions to Determining Exact Ground-States of Ising Spin-Glasses and to their Physics. University of Cologne, Germany, 2004
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: