The following pages link to Frauke Liers (Q291069):
Displaying 34 items.
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- (Q411871) (redirect page) (← links)
- Simplifying maximum flow computations: the effect of shrinking and good initial flows (Q411873) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707) (← links)
- A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions (Q975757) (← links)
- Local cuts revisited (Q1003489) (← links)
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- Robust flows over time: models and complexity results (Q1785195) (← links)
- A decomposition approach for optimal gas network extension with a finite set of demand scenarios (Q1787320) (← links)
- Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks (Q2045011) (← links)
- Outer approximation for mixed-integer nonlinear robust optimization (Q2095574) (← links)
- Robust approximation of chance constrained DC optimal power flow under decision-dependent uncertainty (Q2140173) (← links)
- Joint model of probabilistic-robust (probust) constraints applied to gas network optimization (Q2244692) (← links)
- Solving network design problems via iterative aggregation (Q2516352) (← links)
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization (Q2638389) (← links)
- A rolling-horizon approach for multi-period optimization (Q2670577) (← links)
- Robust market equilibria under uncertain cost (Q2672150) (← links)
- Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
- Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
- Structural Investigation of Piecewise Linearized Network Flow Problems (Q2954170) (← links)
- Crossing Minimization in Storyline Visualization (Q2961530) (← links)
- An Exact Algorithm for Robust Network Design (Q3091477) (← links)
- Models and Algorithms for Robust Network Design with Several Traffic Scenarios (Q3167631) (← links)
- Radius of Robust Feasibility for Mixed-Integer Problems (Q5084649) (← links)
- Adaptive Bundle Methods for Nonlinear Robust Optimization (Q5106409) (← links)
- Decomposable robust two‐stage optimization: An application to gas network operations under uncertainty (Q5226587) (← links)
- Network Planning and Routing Problems over Time: Models, Complexity and Algorithms (Invited Talk). (Q6075885) (← links)
- Optimization over decision trees: a case study for the design of stable direct-current electricity networks (Q6088547) (← links)
- Optimizing integrated aircraft assignment and turnaround handling (Q6113450) (← links)
- Solving AC Optimal Power Flow with Discrete Decisions to Global Optimality (Q6122091) (← links)
- Improving quantum computation by optimized qubit routing (Q6167090) (← links)
- An integrated rolling horizon and adaptive-refinement approach for disjoint trajectories optimization (Q6173784) (← links)
