Alexander Flecker

dblp:218/7163 · also Alexander S. Flecker · DBLP profile ↗
← Back
8ranked-venue papers
0as first author
5since 2021 · last 2025
0000-0002-4636-2109ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 8 · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 3 since 2021Human-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
4 papers
Mathematical optimization · 73% Graph algorithms and graph theory · 22% Approximation and online algorithms · 4%
Interdisciplinary, comprehensive, and emerging computing
4 papers
Energy systems and smart grids · 58% Environmental and earth informatics · 31% Computational science and engineering · 12%

Topics — the 10 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
multi-objective optimization
2.032025
Constraint-aware Pareto Optimization for Tree-Structured Networks: Addressing Decarbonization Targets with Hydropower Expansion · AAAI 2025
Scaling Up Pareto Optimization for Tree Structures with Affine Transformations: Evaluating Hybrid Floating Solar-Hydropower Systems in the Amazon · AAAI 2024
Efficiently Approximating the Pareto Frontier: Hydropower Dam Placement in the Amazon Basin · AAAI 2018
Mathematical optimization › multi-objective optimization
pareto optimization
1.622025
Constraint-aware Pareto Optimization for Tree-Structured Networks: Addressing Decarbonization Targets with Hydropower Expansion · AAAI 2025
Scaling Up Pareto Optimization for Tree Structures with Affine Transformations: Evaluating Hybrid Floating Solar-Hydropower Systems in the Amazon · AAAI 2024
Graph algorithms and graph theory
connectivity constraints
0.912025
Expanding Connected Components from Alternative Terminals: Global Optimization for Freshwater Fishes Under the UN's 30x30 Conservation Goal · IJCAI 2025
Graph algorithms and graph theory
graph algorithms
0.912025
Expanding Connected Components from Alternative Terminals: Global Optimization for Freshwater Fishes Under the UN's 30x30 Conservation Goal · IJCAI 2025
Mathematical optimization
integer programming
0.912025
Expanding Connected Components from Alternative Terminals: Global Optimization for Freshwater Fishes Under the UN's 30x30 Conservation Goal · IJCAI 2025
Mathematical optimization › combinatorial optimization
network optimization
0.912025
Expanding Connected Components from Alternative Terminals: Global Optimization for Freshwater Fishes Under the UN's 30x30 Conservation Goal · IJCAI 2025
Mathematical optimization › multi-objective optimization
pareto set approximation
0.312018
Efficiently Approximating the Pareto Frontier: Hydropower Dam Placement in the Amazon Basin · AAAI 2018
Approximation and online algorithms › approximation schemes
polynomial-time approximation scheme
0.312018
Efficiently Approximating the Pareto Frontier: Hydropower Dam Placement in the Amazon Basin · AAAI 2018
Environmental and earth informatics › conservation
conservation planning
0.312025
Expanding Connected Components from Alternative Terminals: Global Optimization for Freshwater Fishes Under the UN's 30x30 Conservation Goal · IJCAI 2025
Computational science and engineering
computational sustainability
0.112018
Efficiently Approximating the Pareto Frontier: Hydropower Dam Placement in the Amazon Basin · AAAI 2018

Methods — techniques the papers use, named apart from their topics

integer programming · 1.7graph optimization · 1.7constraint-aware pareto optimization · 1.7pareto frontier pruning · 1.5affine transformation · 1.5mixed-integer programming · 0.7dynamic programming · 0.7
YearPublicationVenuePosition
2025 Constraint-aware Pareto Optimization for Tree-Structured Networks: Addressing Decarbonization Targets with Hydropower Expansion
abstract
Addressing global sustainability challenges as outlined by the United Nations (UN) Sustainable Development Goals (SDGs) often requires navigating many potentially conflicting societal objectives simultaneously. For instance, increasing hydropower production enhances renewable energy supply but may adversely impact people and nature. Understanding these trade-offs is crucial, and the Pareto frontier - the set of solutions that cannot be improved with respect to one objective without negatively affecting another - is a valuable framework. Strategic hydropower planning concerns finding energy portfolios that achieve decarbonization targets, while balancing energy production with socioeconomic and environmental impacts. Previous work has considered exact and approximate algorithms for Pareto optimization for tree-structured networks, such as rivers, for hydropower planning. However, such approaches do not account for bounding constraints, such as realistic energy production targets, critical in real-world applications. Herein, we propose a novel approach for constraint-aware Pareto optimization for tree-structured networks, incorporating objective bounds to ensure more realistic and robust solution outcomes. We apply our constraint-aware Pareto approach to the strategic planning of hydropower expansion, considering energy bounds to adhere to the UN's net zero by 2050 decarbonization targets, in the Magdalena River basin, home to more than 80% of Colombia’s population. Our analysis demonstrates how lower and upper bounds can significantly modify the unconstrained Pareto frontier, revealing that feasible Pareto solutions can be dominated by infeasible solutions, and thus may be ignored by constraint-agnostic solvers. Our results highlight the importance of considering real-world constraints in multi-objective problems such as optimizing hydropower expansion to meet both energy and sustainability goals.
Marc Grimson, Zhongdi Qu, Yue Mao, Aaron M. Ferber, Felipe Siqueira Pacheco, Sebastian Heilpern, Hector Angarita, Alexander Flecker, Carla P. Gomes
AAAI8
2025 Expanding Connected Components from Alternative Terminals: Global Optimization for Freshwater Fishes Under the UN's 30x30 Conservation Goal
abstract
Climate change and biodiversity loss are among humanity’s most pressing challenges. In 2022, under the auspices of the United Nations, over 190 countries reached a historic agreement to address the alarming loss of biodiversity and restore natural ecosystems. Target 3, often referred to as ``30x30'', seeks to effectively protect and manage 30% of the world’s terrestrial, inland water, coastal, and marine areas by 2030. In this work, we address the UN 30x30 target in the context of global freshwater fish conservation. Freshwater ecosystems are disproportionately unprotected, and their biota are declining at an alarming rate. Our goal is to select new protected areas that protect freshwater fish species as much as possible without exceeding total coverage of 30% of land area. To support this goal, we introduce the Expansion of Connected Components from Alternative Terminals Problem, a graph-based optimization problem that captures ecological priorities and connectivity constraints. We analyze its computational complexity, propose novel integer programming formulations, and develop scalable solution methods. We further evaluate its typical-case complexity under diverse settings and demonstrate that our approach scales to a global real-world scope, encompassing approximately 200,000 freshwater basins and 13,000 species, paving the way for implementing the 30x30 target on a worldwide scale.
Yue Mao, Zhongdi Qu, Imanol Miqueleiz, Aaron M. Ferber, Sami Wolf, Marc Grimson, Sebastian Heilpern, Felipe Siqueira Pacheco, Alexander Flecker, Peter B. McIntyre, Carla P. Gomes
IJCAI9
2024 Scaling Up Pareto Optimization for Tree Structures with Affine Transformations: Evaluating Hybrid Floating Solar-Hydropower Systems in the Amazon
abstract
Sustainability challenges inherently involve the consideration of multiple competing objectives. The Pareto frontier – the set of all optimal solutions that cannot be improved with respect to one objective without negatively affecting another – is a crucial decision-making tool for navigating sustainability challenges as it highlights the inherent trade-offs among conflicting objectives. Our research is motivated by the strategic planning of hydropower in the Amazon basin, one of the earth’s largest and most biodiverse river systems, where the need to increase energy production coincides with the pressing requirement of minimizing detrimental environmental impacts. We investigate an innovative strategy that pairs hydropower with Floating Photovoltaic Solar Panels (FPV). We provide a new extended multi-tree network formulation, which enables the consideration of multiple dam configurations. To address the computational challenge of scaling up the Pareto optimization framework to tackle multiple objectives across the entire Amazon basin, we further enhance the state-of-the-art algorithm for Pareto frontiers in tree-structured networks with two improvements. We introduce affine transformations induced by the sub-frontiers to compute Pareto dominance and provide strategies for merging sub-trees, significantly increasing the pruning of dominated solutions. Our experiments demonstrate considerable speedups, in some cases by more than an order of magnitude, while maintaining optimality guarantees, thus allowing us to more effectively approximate the Pareto frontiers. Moreover, our findings suggest significant shifts towards higher energy values in the Pareto frontier when pairing hybrid hydropower with FPV solutions, potentially amplifying energy production while mitigating adverse impacts.
Marc Grimson, Rafael Almeida, Qinru Shi, Yiwei Bai, Hector Angarita, Felipe Siqueira Pacheco, Rafael Schmitt, Alexander Flecker, Carla P. Gomes
AAAI8
2024 Strategies for Compressing the Pareto Frontier: Application to Strategic Planning of Hydropower in the Amazon Basin
Zhongdi Qu, Marc Grimson, Yue Mao, Sebastian Heilpern, Imanol Miqueleiz, Felipe Siqueira Pacheco, Alexander Flecker, Carla P. Gomes
CPAIOR (2)7
2023 Efficiently Approximating High-Dimensional Pareto Frontiers for Tree-Structured Networks Using Expansion and Compression
Yiwei Bai, Qinru Shi, Marc Grimson, Alexander Flecker, Carla P. Gomes
CPAIOR4
2018 Efficiently Approximating the Pareto Frontier: Hydropower Dam Placement in the Amazon Basin
abstract
Real-world problems are often not fully characterized by a single optimal solution, as they frequently involve multiple competing objectives; it is therefore important to identify the so-called Pareto frontier, which captures solution trade-offs. We propose a fully polynomial-time approximation scheme based on Dynamic Programming (DP) for computing a polynomially succinct curve that approximates the Pareto frontier to within an arbitrarily small epsilon > 0 on tree-structured networks. Given a set of objectives, our approximation scheme runs in time polynomial in the size of the instance and 1/epsilon. We also propose a Mixed Integer Programming (MIP) scheme to approximate the Pareto frontier. The DP and MIP Pareto frontier approaches have complementary strengths and are surprisingly effective. We provide empirical results showing that our methods outperform other approaches in efficiency and accuracy. Our work is motivated by a problem in computational sustainability concerning the proliferation of hydropower dams throughout the Amazon basin. Our goal is to support decision-makers in evaluating impacted ecosystem services on the full scale of the Amazon basin. Our work is general and can be applied to approximate the Pareto frontier of a variety of multiobjective problems on tree-structured networks.
Xiaojian Wu, Jonathan Gomes-Selman, Qinru Shi, Yexiang Xue, Roosevelt García-Villacorta, Elizabeth Anderson, Suresh Sethi 0001, Scott Steinschneider, Alexander Flecker, Carla P. Gomes
AAAI9
2018 Boosting Efficiency for Computing the Pareto Frontier on Tree Structured Networks
Jonathan Gomes-Selman, Qinru Shi, Yexiang Xue, Roosevelt García-Villacorta, Alexander Flecker, Carla P. Gomes
CPAIOR5
2018 Efficiently Optimizing for Dendritic Connectivity on Tree-Structured Networks in a Multi-Objective Framework
abstract
We provide an exact and approximation algorithm based on Dynamic Programming and an approximation algorithm based on Mixed Integer Programming for optimizing for the so-called dendritic connectivity on tree-structured networks in a multi-objective setting. Dendritic connectivity describes the degree of connectedness of a network. We consider different variants of dendritic connectivity to capture both network connectivity with respect to long and short-to-middle distances. Our work is motivated by a problem in computational sustainability concerning the evaluation of trade-offs in ecosystem services due to the proliferation of hydropower dams throughout the Amazon basin. In particular, we consider trade-offs between energy production and river connectivity. River fragmentation can dramatically affect fish migrations and other ecosystem services, such as navigation and transportation. In the context of river networks, different variants of dendritic connectivity are important to characterize the movements of different fish species and human populations. Our approaches are general and can be applied to optimizing for dendritic connectivity for a variety of multi-objective problems on tree-structured networks.
Qinru Shi, Jonathan Gomes-Selman, Roosevelt García-Villacorta, Suresh Sethi 0001, Alexander Flecker, Carla P. Gomes
COMPASS5