Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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

H. Assimi, O. Harper, Y. Xie, A. Neumann, and F. Neumann. ECAI, volume 325 of Frontiers in Artificial Intelligence and Applications, page 307-314. IOS Press, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Frank Neumann

Other publications of authors with the same name

A fast and effective local search algorithm for optimizing the placement of wind turbinesM. Wagner, J. Day, and F. Neumann. Renewable Energy, (March 2013)Weighted preferences in evolutionary multi-objective optimization.T. Friedrich, T. Kroeger, and F. Neumann. Int. J. Machine Learning & Cybernetics, 4 (2): 139-148 (2013)Feature-Based Diversity Optimization for Problem Instance Classification.W. Gao, S. Nallaperuma, and F. Neumann. Evol. Comput., 29 (1): 107-128 (2021)Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings.V. Doskoc, T. Friedrich, A. Göbel, F. Neumann, A. Neumann, and F. Quinzan. CoRR, (2019)Computing Diverse Sets of Solutions for Monotone Submodular Optimisation Problems.A. Neumann, J. Bossek, and F. Neumann. CoRR, (2020)The Dynamic Travelling Thief Problem: Benchmarks and Performance of Evolutionary Algorithms.R. Sachdeva, F. Neumann, and M. Wagner. ICONIP (5), volume 1333 of Communications in Computer and Information Science, page 220-228. Springer, (2020)Improved runtime results for simple randomised search heuristics on linear functions with a uniform constraint.F. Neumann, M. Pourhassan, and C. Witt. GECCO, page 1506-1514. ACM, (2019)Analysis of baseline evolutionary algorithms for the packing while travelling problem.V. Roostapour, M. Pourhassan, and F. Neumann. FOGA, page 124-132. ACM, (2019)Robust Fitting in Computer Vision: Easy or Hard?T. Chin, Z. Cai, and F. Neumann. Int. J. Comput. Vis., 128 (3): 575-587 (2020)Evolutionary Multi-Objective Algorithms for the Knapsack Problems with Stochastic Profits.K. Perera, A. Neumann, and F. Neumann. CoRR, (2023)

BibSonomy

Disambiguation of "Neumann, Frank"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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

Please choose a person to relate this publication to

Frank Neumann

Frank Neumann

Frank Neumann

Frank Neumann

Frank Neumann

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Neumann, Frank"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Evolutionary Bi-Objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives.

Please choose a person to relate this publication to

Frank Neumann

Frank Neumann

Frank Neumann

Frank Neumann

Frank Neumann

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

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