default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKolos Csaba Ágoston
Person information
- affiliation: Corvinus University of Budapest, Hungary
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j9]László Csató
, Kolos Csaba Ágoston, Sándor Bozóki:
On the coincidence of optimal completions for small pairwise comparison matrices with missing entries. Ann. Oper. Res. 333(1): 239-247 (2024)- [j8]Kolos Csaba Ágoston, Marianna E.-Nagy:
Mixed integer linear programming formulation for K-means clustering problem. Central Eur. J. Oper. Res. 32(1): 11-27 (2024) - [j7]Kolos Csaba Ágoston, László Csató:
A lexicographically optimal completion for pairwise comparison matrices with missing entries. Eur. J. Oper. Res. 314(3): 1078-1086 (2024) - 2022
- [j6]Kolos Csaba Ágoston, Péter Biró, Endre Kováts, Zsuzsanna Jankó:
College admissions with ties and common quotas: Integer programming approach. Eur. J. Oper. Res. 299(2): 722-734 (2022) - 2019
- [j5]Kolos Csaba Ágoston:
The Effect of Welding on the One-Dimensional Cutting-Stock Problem: The Case of Fixed Firefighting Systems in the Construction Industry. Adv. Oper. Res. 2019: 6507054:1-6507054:12 (2019) - 2018
- [j4]Márton Gyetvai, Kolos Csaba Ágoston:
Optimization of transition rules in a Bonus-Malus system. Electron. Notes Discret. Math. 69: 5-12 (2018) - 2016
- [j3]Kolos Csaba Ágoston, Gábor Benedek, Zsolt Gilányi:
Pareto improvement and joint cash management optimisation for banks and cash-in-transit firms. Eur. J. Oper. Res. 254(3): 1074-1082 (2016) - [j2]Kolos Csaba Ágoston, Péter Biró, Iain McBride:
Integer programming methods for special college admissions problems. J. Comb. Optim. 32(4): 1371-1399 (2016) - 2012
- [j1]Kolos Csaba Ágoston:
CVaR minimization by the SRA algorithm. Central Eur. J. Oper. Res. 20(4): 623-632 (2012)
Conference and Workshop Papers
- 2020
- [c2]Kolos Csaba Ágoston, Agnes Vaskoevi:
Clustering EU Countries Based On Death Probabilities. ECMS 2020: 91-96 - 2017
- [c1]Kolos Csaba Ágoston, Péter Biró:
Modelling Preference Ties And Equal Treatment Policy. ECMS 2017: 516-522
Informal and Other Publications
- 2021
- [i2]Kolos Csaba Ágoston, László Csató:
Extension of Saaty's inconsistency index to incomplete comparisons: Approximated thresholds. CoRR abs/2102.10558 (2021) - 2017
- [i1]Kolos Csaba Ágoston, Péter Biró, Richárd Szántó:
Stable project allocation under distributional constraints. CoRR abs/1711.04484 (2017)
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 2025-01-21 00:23 CET 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:
