default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrzej Jaszkiewicz
Person information
- affiliation: Poznan University of Technology, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i6]Grzegorz Kaszuba, Amirhossein D. Naghdi, Dario Massa, Stefanos Papanikolaou, Andrzej Jaszkiewicz, Piotr Sankowski:
In-Context Learning of Physical Properties: Few-Shot Adaptation to Out-of-Distribution Molecular Graphs. CoRR abs/2406.01808 (2024)- 2023
- [c13]Andrzej Jaszkiewicz
, Piotr Zielniewicz:
On-line Quick Hypervolume Algorithm. GECCO Companion 2023: 371-374 - 2022
- [j21]Richard Allmendinger, Andrzej Jaszkiewicz, Arnaud Liefooghe, Christiane Tammer:
What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization. Comput. Oper. Res. 145: 105857 (2022) - [c12]Piotr Beling, Piotr Cybula, Andrzej Jaszkiewicz, Przemyslaw Pelka, Marek Rogalski, Piotr Sielski:
Deep Infeasibility Exploration Method for Vehicle Routing Problems. EvoCOP 2022: 62-78 - [c11]Andrzej Jaszkiewicz, Piotr Zielniewicz:
Greedy Decremental Quick Hypervolume Subset Selection Algorithms. PPSN (2) 2022: 164-178 - [c10]Piotr Cybula, Andrzej Jaszkiewicz, Przemyslaw Pelka, Marek Rogalski, Piotr Sielski:
Evolutionary Algorithm for Vehicle Routing with Diversity Oscillation Mechanism. PPSN (1) 2022: 279-293 - 2021
- [c9]Piotr Cybula, Marek Rogalski, Piotr Sielski, Andrzej Jaszkiewicz, Przemyslaw Pelka:
Effective recombination operators for the family of vehicle routing problems. GECCO Companion 2021: 121-122 - [c8]Andrzej Jaszkiewicz, Piotr Zielniewicz:
Quick extreme hypervolume contribution algorithm. GECCO 2021: 412-420 - [i5]Richard Allmendinger, Andrzej Jaszkiewicz, Arnaud Liefooghe, Christiane Tammer:
What if we Increase the Number of Objectives? Theoretical and Empirical Implications for Many-objective Optimization. CoRR abs/2106.03275 (2021) - 2020
- [c7]Andrzej Jaszkiewicz, Robert Susmaga, Piotr Zielniewicz:
Approximate Hypervolume Calculation with Guaranteed or Confidence Bounds. PPSN (1) 2020: 215-228
2010 – 2019
- 2019
- [j20]Mansoureh Aghabeig, Andrzej Jaszkiewicz:
Experimental analysis of design elements of scalarizing function-based multiobjective evolutionary algorithms. Soft Comput. 23(21): 10769-10780 (2019) - [c6]Andrzej Jaszkiewicz:
Minimum spanning tree-based clustering of large pareto archives. GECCO (Companion) 2019: 1252-1253 - 2018
- [j19]Andrzej Jaszkiewicz:
Improved quick hypervolume algorithm. Comput. Oper. Res. 90: 72-83 (2018) - [j18]Andrzej Jaszkiewicz:
Many-Objective Pareto Local Search. Eur. J. Oper. Res. 271(3): 1001-1013 (2018) - [j17]Andrzej Jaszkiewicz, Thibaut Lust:
ND-Tree-Based Update: A Fast Algorithm for the Dynamic Nondominance Problem. IEEE Trans. Evol. Comput. 22(5): 778-791 (2018) - 2017
- [j16]Andrzej Jaszkiewicz, Thibaut Lust:
Proper balance between search towards and along Pareto front: biobjective TSP case study. Ann. Oper. Res. 254(1-2): 111-130 (2017) - [i4]Mansoureh Aghabeig, Andrzej Jaszkiewicz:
Experimental Analysis of Design Elements of Scalarizing Functions-based Multiobjective Evolutionary Algorithms. CoRR abs/1703.09469 (2017) - [i3]Andrzej Jaszkiewicz:
Many-Objective Pareto Local Search. CoRR abs/1707.07899 (2017) - 2016
- [i2]Andrzej Jaszkiewicz, Thibaut Lust:
ND-Tree: a Fast Online Algorithm for Updating a Pareto Archive and its Application in Many-objective Pareto Local Search. CoRR abs/1603.04798 (2016) - [i1]Andrzej Jaszkiewicz:
Improved Quick Hypervolume Algorithm. CoRR abs/1612.03402 (2016) - 2013
- [c5]Krzysztof Dembczynski, Wojciech Kotlowski, Przemyslaw Gawel, Adam Szarecki, Andrzej Jaszkiewicz:
Matrix Factorization for Travel Time Estimation in Large Traffic Networks. ICAISC (2) 2013: 500-510 - 2012
- [c4]Przemyslaw Gawel, Krzysztof Dembczynski, Robert Susmaga, Przemyslaw Wesolek, Piotr Zielniewicz, Andrzej Jaszkiewicz:
Adapting Travel Time Estimates to Current Traffic Conditions. ADBIS Workshops 2012: 79-88 - [c3]Przemyslaw Gawel, Krzysztof Dembczynski, Wojciech Kotlowski, Marek Kubiak, Robert Susmaga, Piotr Zielniewicz, Andrzej Jaszkiewicz:
Community Traffic: A Technology for the Next Generation Car Navigation. ADBIS Workshops 2012: 339-348 - [p2]Andrzej Jaszkiewicz, Hisao Ishibuchi, Qingfu Zhang:
Multiobjective Memetic Algorithms. Handbook of Memetic Algorithms 2012: 201-217 - 2010
- [j15]Thibaut Lust, Andrzej Jaszkiewicz:
Speed-up techniques for solving large-scale biobjective TSP. Comput. Oper. Res. 37(3): 521-533 (2010)
2000 – 2009
- 2009
- [j14]Andrzej Jaszkiewicz, Mariusz Kaczmarek, Jacek Zak:
Advanced OR and AI methods in transportation. Eur. J. Oper. Res. 193(3): 865-866 (2009) - [j13]Andrzej Jaszkiewicz, Piotr Zielniewicz:
Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem. Eur. J. Oper. Res. 193(3): 885-890 (2009) - 2008
- [j12]Andrzej Jaszkiewicz:
Distance Preserving Recombination Operator for Earth Observation Satellites Operations Scheduling. J. Math. Model. Algorithms 7(1): 25-42 (2008) - [c2]Andrzej Jaszkiewicz, Jürgen Branke:
Interactive Multiobjective Evolutionary Algorithms. Multiobjective Optimization 2008: 179-193 - 2006
- [j11]Andrzej Jaszkiewicz, Daniel Tuyttens:
Metaheuristics in multiple objective optimization. Eur. J. Oper. Res. 169(3): 873-874 (2006) - 2004
- [j10]Andrzej Jaszkiewicz:
A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm. Ann. Oper. Res. 131(1-4): 135-158 (2004) - [j9]Andrzej Jaszkiewicz:
On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study. Eur. J. Oper. Res. 158(2): 418-433 (2004) - [p1]Andrzej Jaszkiewicz:
Evaluation of Multiple Objective Metaheuristics. Metaheuristics for Multiobjective Optimisation 2004: 65-89 - 2003
- [j8]Andrzej Jaszkiewicz, Pawel Kominek:
Genetic local search with distance preserving recombination operator for a vehicle routing problem. Eur. J. Oper. Res. 151(2): 352-364 (2003) - [j7]Andrzej Jaszkiewicz:
Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem. IEEE Trans. Evol. Comput. 7(2): 133-143 (2003) - 2002
- [j6]Andrzej Jaszkiewicz:
Genetic local search for multi-objective combinatorial optimization. Eur. J. Oper. Res. 137(1): 50-71 (2002) - [j5]Andrzej Jaszkiewicz:
On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment. IEEE Trans. Evol. Comput. 6(4): 402-412 (2002) - 2001
- [c1]Andrzej Jaszkiewicz, Maciej Hapke, Pawel Kominek:
Performance of Multiple Objective Evolutionary Algorithms on a Distribution System Design Problem - Computational Experiment. EMO 2001: 241-255 - 2000
- [j4]Maciej Hapke, Andrzej Jaszkiewicz, Roman Slowinski:
Pareto Simulated Annealing for Fuzzy Multi-Objective Combinatorial Optimization. J. Heuristics 6(3): 329-345 (2000)
1990 – 1999
- 1999
- [j3]Andrzej Jaszkiewicz, A. B. Ferhat:
Solving multiple criteria choice problems by interactive trichotomy segmentation. Eur. J. Oper. Res. 113(2): 271-280 (1999) - [j2]Andrzej Jaszkiewicz, Roman Slowinski:
The 'Light Beam Search' approach - an overview of methodology and applications. Eur. J. Oper. Res. 113(2): 300-314 (1999) - 1998
- [j1]Maciej Hapke, Andrzej Jaszkiewicz, Roman Slowinski:
Interactive analysis of multiple-criteria project scheduling problems. Eur. J. Oper. Res. 107(2): 315-324 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
