A. Jaszkiewicz - Citegraph

Author Info

Name	Affiliation	Papers
A. JASZKIEWICZ	Poznań University of Technology, Institute of Computing Science, Ul. Piotrowo 3A, 60-965 Poznań, Poland	30
Collaborators	Citations	PageRank
32	660	50.68
Referers	Referees	References
1097	253	219

Search Limit

1001000

Publications (30 rows)

Collaborators (32 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Deep Infeasibility Exploration Method for Vehicle Routing Problems	0	0.34	2022
What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization	0	0.34	2022
Greedy Decremental Quick Hypervolume Subset Selection Algorithms	0	0.34	2022
Quick extreme hypervolume contribution algorithm	0	0.34	2021
Effective recombination operators for the family of vehicle routing problems	0	0.34	2021
Minimum spanning tree-based clustering of large pareto archives.	0	0.34	2019
Many-Objective Pareto Local Search.	1	0.37	2018
Improved quick hypervolume algorithm	1	0.36	2018
ND-Tree-Based Update: A Fast Algorithm for the Dynamic Nondominance Problem.	0	0.34	2018
Experimental Analysis of Design Elements of Scalarizing Functions-based Multiobjective Evolutionary Algorithms.	0	0.34	2017
Proper balance between search towards and along Pareto front: biobjective TSP case study.	5	0.42	2017
Adapting Travel Time Estimates to Current Traffic Conditions.	0	0.34	2012
Community Traffic: A Technology for the Next Generation Car Navigation.	0	0.34	2012
Speed-up techniques for solving large-scale biobjective TSP	23	0.83	2010
Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem	18	0.82	2009
Advanced OR and AI methods in transportation	9	0.89	2009
Distance Preserving Recombination Operator for Earth Observation Satellites Operations Scheduling	0	0.34	2008
Interactive Multiobjective Evolutionary Algorithms	14	0.86	2008
Metaheuristics in multiple objective optimization	0	0.34	2006
On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study	63	3.04	2004
A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm	18	0.95	2004
Genetic local search with distance preserving recombination operator for a vehicle routing problem	17	1.18	2003
Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem	51	2.28	2003
On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment	189	11.57	2002
Genetic local search for multi-objective combinatorial optimization	132	9.58	2002
Performance of Multiple Objective Evolutionary Algorithms on a Distribution System Design Problem - Computational Experiment	5	0.69	2001
Pareto Simulated Annealing for Fuzzy Multi-Objective Combinatorial Optimization	13	1.32	2000
Solving multiple criteria choice problems by interactive trichotomy segmentation	8	0.70	1999
The ‘Light Beam Search’ approach – an overview of methodology applications	65	5.52	1999
Interactive analysis of multiple-criteria project scheduling problems	28	5.25	1998