activity
20192022
most citedEvolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives

9 citations · 17 across the 6 of their papers we have counts for

collaborators

7 papers

cs.NE20222 cited

Evolutionary Algorithms for Limiting the Effect of Uncertainty for the Knapsack Problem with Stochastic Profits

Aneta Neumann, Yue Xie, Frank Neumann

Evolutionary algorithms have been widely used for a range of stochastic optimization problems in order to address complex real-world optimization problems. We consider the knapsack…

cs.NE2021

Heuristic Strategies for Solving Complex Interacting Large-Scale Stockpile Blending Problems

Yue Xie, Aneta Neumann, Frank Neumann

The Stockpile blending problem is an important component of mine production scheduling, where stockpiles are used to store and blend raw material. The goal of blending material fro…

cs.DS20214 cited

Runtime Analysis of RLS and the (1+1) EA for the Chance-constrained Knapsack Problem with Correlated Uniform Weights

Yue Xie, Aneta Neumann, Frank Neumann +1

Addressing a complex real-world optimization problem is a challenging task. The chance-constrained knapsack problem with correlated uniform weights plays an important role in the c…

cs.NE2021

Heuristic Strategies for Solving Complex Interacting Stockpile Blending Problem with Chance Constraints

Yue Xie, Aneta Neumann, Frank Neumann

Heuristic algorithms have shown a good ability to solve a variety of optimization problems. Stockpile blending problem as an important component of the mine scheduling problem is a…

cs.NE20202 cited

Specific Single- and Multi-Objective Evolutionary Algorithms for the Chance-Constrained Knapsack Problem

Yue Xie, Aneta Neumann, Frank Neumann

The chance-constrained knapsack problem is a variant of the classical knapsack problem where each item has a weight distribution instead of a deterministic weight. The objective is…

cs.NE20209 cited

Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives

Hirad Assimi, Oscar Harper, Yue Xie +2

Real-world combinatorial optimization problems are often stochastic and dynamic. Therefore, it is essential to make optimal and reliable decisions with a holistic approach. In this…