Engineering Negative Cycle Canceling for Wind Farm Cabling

DOI10.4230/LIPIcs.ESA.2019.55OpenAlexW2978694610MaRDI QIDQ5075800

Franziska Wegner, Torsten Ueckerdt, Matthias Wolf, Dorothea Wagner, Sascha Gritzbach

Publication date: 11 May 2022

Full work available at URL: https://arxiv.org/abs/1908.02129

zbMATH Keywords

step cost functionnegative cycle cancelingwind farm planning

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Solver-free heuristics to retrieve feasible points for offshore wind farm collection system

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Negative-cycle detection algorithms
• Exact solution of multicommodity network optimization problems with general step cost functions
• Tight bounds on the number of minimum-mean cycle cancellations and related results
• On the complexity of detecting \(k\)-length negative cost cycles
• A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
• A heuristic improvement of the Bellman-Ford algorithm
• On a routing problem
• Finding minimum-cost circulations by canceling negative cycles
• The complexity of the capacitated tree problem
• Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
• Shortest path algorithms using dynamic breadth‐first search

This page was built for publication: Engineering Negative Cycle Canceling for Wind Farm Cabling