default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichal Tomczyk
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
[j6]Michal K. Tomczyk
, Milosz Kadzinski:
Evolutionary algorithms for solving single- and multiple-objective political redistricting problems: The case study of Poland. Appl. Soft Comput. 152: 111258 (2024)- [c7]Michal Tomczyk, Milosz Kadzinski:
Interactive tool for visualizing the comprehensive performance of evolutionary multi-objective algorithms applied to problems with two or three objectives. GECCO Companion 2024: 375-378 - 2023
- [c6]Michal Tomczyk, Milosz Kadzinski:
Co-evolution improves the efficiency of preference learning methods when the Decision Maker's aspirations develop over time. GECCO 2023: 759-767 - 2022
- [j5]Michal K. Tomczyk, Milosz Kadzinski:
Interactive co-evolutionary multiple objective optimization algorithms for finding consensus solutions for a group of Decision Makers. Inf. Sci. 616: 157-181 (2022) - 2021
- [j4]Michal K. Tomczyk, Milosz Kadzinski:
Decomposition-based co-evolutionary algorithm for interactive multiple objective optimization. Inf. Sci. 549: 178-199 (2021) - [c5]Michal K. Tomczyk, Milosz Kadzinski:
Interactive evolutionary multiple objective optimization algorithm using a fast calculation of holistic acceptabilities. GECCO 2021: 476-484 - 2020
- [j3]Milosz Kadzinski, Michal K. Tomczyk, Roman Slowinski:
Preference-based cone contraction algorithms for interactive evolutionary multiple objective optimization. Swarm Evol. Comput. 52 (2020) - [j2]Michal K. Tomczyk, Milosz Kadzinski:
Decomposition-Based Interactive Evolutionary Algorithm for Multiple Objective Optimization. IEEE Trans. Evol. Comput. 24(2): 320-334 (2020) - [c4]Michal K. Tomczyk, Milosz Kadzinski:
On the elicitation of indirect preferences in interactive evolutionary multiple objective optimization. GECCO 2020: 569-577
2010 – 2019
- 2019
- [j1]Michal K. Tomczyk, Milosz Kadzinski:
EMOSOR: Evolutionary multiple objective optimization guided by interactive stochastic ordinal regression. Comput. Oper. Res. 108: 134-154 (2019) - [c3]Michal K. Tomczyk, Milosz Kadzinski:
Robust indicator-based algorithm for interactive evolutionary multiple objective optimization. GECCO 2019: 629-637 - 2018
- [c2]Milosz Kadzinski, Michal K. Tomczyk, Roman Slowinski:
Interactive Cone Contraction for Evolutionary Mutliple Objective Optimization. Advances in Data Analysis with Computational Intelligence Methods 2018: 293-309 - 2015
- [c1]Milosz Kadzinski, Michal Tomczyk:
Using Ordinal Regression for Interactive Evolutionary Multiple Objective Optimization with Multiple Decision Makers. GDN 2015: 185-198
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-08-23 18:28 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:
