Frauke Liers

According to our database1, Frauke Liers authored at least 24 papers between 2007 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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, 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


  Loading...