Andrzej Jaszkiewicz
Orcid: 0000-0002-8337-888XAffiliations:
- Poznan University of Technology, Poland
According to our database1,
Andrzej Jaszkiewicz
authored at least 40 papers
between 1998 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2000
2005
2010
2015
2020
0
1
2
3
4
5
1
1
1
1
1
1
3
2
1
1
2
1
1
2
2
2
1
2
1
1
3
2
1
1
1
2
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
In-Context Learning of Physical Properties: Few-Shot Adaptation to Out-of-Distribution Molecular Graphs.
CoRR, 2024
2023
Proceedings of the Companion Proceedings of the Conference on Genetic and Evolutionary Computation, 2023
2022
What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization.
Comput. Oper. Res., 2022
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022
Proceedings of the Parallel Problem Solving from Nature - PPSN XVII, 2022
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2022
2021
What if we Increase the Number of Objectives? Theoretical and Empirical Implications for Many-objective Optimization.
CoRR, 2021
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021
Proceedings of the GECCO '21: Genetic and Evolutionary Computation Conference, 2021
2020
Proceedings of the Parallel Problem Solving from Nature - PPSN XVI, 2020
2019
Experimental analysis of design elements of scalarizing function-based multiobjective evolutionary algorithms.
Soft Comput., 2019
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019
2018
IEEE Trans. Evol. Comput., 2018
2017
Experimental Analysis of Design Elements of Scalarizing Functions-based Multiobjective Evolutionary Algorithms.
CoRR, 2017
Proper balance between search towards and along Pareto front: biobjective TSP case study.
Ann. Oper. Res., 2017
2016
ND-Tree: a Fast Online Algorithm for Updating a Pareto Archive and its Application in Many-objective Pareto Local Search.
CoRR, 2016
2013
Proceedings of the Artificial Intelligence and Soft Computing, 2013
2012
Proceedings of the Handbook of Memetic Algorithms, 2012
Proceedings of the New Trends in Databases and Information Systems, 2012
Proceedings of the New Trends in Databases and Information Systems, 2012
2010
Comput. Oper. Res., 2010
2009
Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem.
Eur. J. Oper. Res., 2009
2008
Distance Preserving Recombination Operator for Earth Observation Satellites Operations Scheduling.
J. Math. Model. Algorithms, 2008
Proceedings of the Multiobjective Optimization, 2008
2006
2004
On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study.
Eur. J. Oper. Res., 2004
A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm.
Ann. Oper. Res., 2004
Proceedings of the Metaheuristics for Multiobjective Optimisation, 2004
2003
Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem.
IEEE Trans. Evol. Comput., 2003
Genetic local search with distance preserving recombination operator for a vehicle routing problem.
Eur. J. Oper. Res., 2003
2002
On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment.
IEEE Trans. Evol. Comput., 2002
Eur. J. Oper. Res., 2002
2001
Performance of Multiple Objective Evolutionary Algorithms on a Distribution System Design Problem - Computational Experiment.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2001
2000
J. Heuristics, 2000
1999
Eur. J. Oper. Res., 1999
Eur. J. Oper. Res., 1999
1998
Eur. J. Oper. Res., 1998