Siting renewable power generation assets with combinatorial optimisation
From MaRDI portal
Publication:2119746
DOI10.1007/s11590-021-01795-0zbMath1489.90148OpenAlexW3088264396MaRDI QIDQ2119746
Damien Ernst, Mathias Berger, Yury Dvorkin, Antoine Dubois, David Radu, Quentin Louveaux, Hrvoje Pandžić
Publication date: 30 March 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://orbi.uliege.be/handle/2268/251037
renewable energycombinatorial optimisationcoverage problemsasset sitingresource complementaritysubmodular maximisation
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomized approximation of bounded multicovering problems
- SCIP: solving constraint integer programs
- Approximation algorithms for combinatorial problems
- Computing approximate solutions of the maximum covering problem with GRASP
- Computational experience with approximation algorithms for the set covering problem
- Directed hypergraphs and applications
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- Tight approximation bounds for maximum multi-coverage
- Julia: A Fresh Approach to Numerical Computing
- A threshold of ln n for approximating set cover
- The Densest $k$-Subhypergraph Problem
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- On the power of unique 2-prover 1-round games
- A Greedy Heuristic for the Set-Covering Problem
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- An analysis of approximations for maximizing submodular set functions—I
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
- Beyond the Worst-Case Analysis of Algorithms
- Tackling Industrial-Scale Supply Chain Problems by Mixed-Integer Programming
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Fast algorithms for maximizing submodular functions
- Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search
- JuMP: A Modeling Language for Mathematical Optimization
This page was built for publication: Siting renewable power generation assets with combinatorial optimisation
