default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJörg Kalcsics
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Syu-Ning Johnn
, Victor-Alexandru Darvariu, Julia Handl, Jörg Kalcsics:
A Graph Reinforcement Learning Framework for Neural Adaptive Large Neighbourhood Search. Comput. Oper. Res. 172: 106791 (2024)- [j30]Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove, William Pettersson:
New Algorithms for Hierarchical Optimization in Kidney Exchange Programs. Oper. Res. 72(4): 1654-1673 (2024) - [j29]Marta Baldomero-Naranjo, Jörg Kalcsics, Antonio M. Rodríguez-Chía:
On the complexity of the upgrading version of the maximal covering location problem. Networks 83(4): 627-641 (2024) - [i5]Marta Baldomero-Naranjo, Jörg Kalcsics, Antonio M. Rodríguez-Chía:
On the complexity of the upgrading version of the maximal covering location problem. CoRR abs/2409.11900 (2024) - 2023
- [j28]Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics, Linda Kleist:
Competitive location problems: balanced facility location and the One-Round Manhattan Voronoi Game. Ann. Oper. Res. 321(1): 79-101 (2023) - [j27]M. Barkhagen, Sergio García, Jacek Gondzio, Jörg Kalcsics, J. Kroeske, Sotirios Sabanis, A. Staal:
Optimising portfolio diversification and dimensionality. J. Glob. Optim. 85(1): 185-234 (2023) - [c4]Syu-Ning Johnn, Victor-Alexandru Darvariu, Julia Handl, Jörg Kalcsics:
GRAPH Reinforcement Learning for Operator Selection in the ALNS Metaheuristic. OLA 2023: 200-212 - [i4]Syu-Ning Johnn, Victor-Alexandru Darvariu, Julia Handl, Jörg Kalcsics:
Graph Reinforcement Learning for Operator Selection in the ALNS Metaheuristic. CoRR abs/2302.14678 (2023) - [i3]Marta Baldomero-Naranjo, Víctor Blanco, Sergio García, Ricardo Gázquez, Jörg Kalcsics, Luisa I. Martínez-Merino, Juan Manuel Muñoz-Ocaña, Francisco Temprano, Alberto Torrejón:
Proceedings of the XII International Workshop on Locational Analysis and Related Problems. CoRR abs/2309.08337 (2023) - 2022
- [j26]Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove, William Pettersson, James Trimble:
Improved instance generation for kidney exchange programmes. Comput. Oper. Res. 141: 105707 (2022) - [j25]Thomas Byrne, Jörg Kalcsics:
Conditional facility location problems with continuous demand and a polygonal barrier. Eur. J. Oper. Res. 296(1): 22-43 (2022) - [j24]Marta Baldomero-Naranjo, Jörg Kalcsics, Alfredo Marín, Antonio M. Rodríguez-Chía:
Upgrading edges in the maximal covering location problem. Eur. J. Oper. Res. 303(1): 14-36 (2022) - 2021
- [j23]William Pettersson, Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove:
Improving solution times for stable matching problems through preprocessing. Comput. Oper. Res. 128: 105128 (2021) - [j22]Marta Baldomero-Naranjo, Jörg Kalcsics, Antonio M. Rodríguez-Chía:
Minmax regret maximal covering location problems with edge demands. Comput. Oper. Res. 130: 105181 (2021) - [j21]Igor Averbakh, Oded Berman, Jörg Kalcsics, Dmitry Krass:
Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams. Discret. Appl. Math. 300: 36-55 (2021) - [c3]Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics, Linda Kleist:
Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game. WALCOM 2021: 103-115 - 2020
- [i2]Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics, Linda Kleist:
Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game. CoRR abs/2011.13275 (2020)
2010 – 2019
- 2019
- [j20]Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove, William Pettersson:
Mathematical models for stable matching problems with ties and incomplete lists. Eur. J. Oper. Res. 277(2): 426-441 (2019) - [j19]Seda Yanik, Jörg Kalcsics, Stefan Nickel, Burçin Bozkaya:
A multi-period multi-criteria districting problem applied to primary care scheme with gradual assignment. Int. Trans. Oper. Res. 26(5): 1676-1697 (2019) - 2018
- [j18]Matthias Bender, Jörg Kalcsics, Stefan Nickel, Martin Pouls:
A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design. Eur. J. Oper. Res. 269(1): 382-396 (2018) - [i1]Maxence Delorme, Sergio García, Jacek Gondzio, Jörg Kalcsics, David F. Manlove, William Pettersson:
Mathematical models for stable matching problems with ties and incomplete lists. CoRR abs/1810.02711 (2018) - 2017
- [j17]Elena Fernández, Jörg Kalcsics, Cristina Núñez-del-Toro:
A branch-and-price algorithm for the Aperiodic Multi-Period Service Scheduling Problem. Eur. J. Oper. Res. 263(3): 805-814 (2017) - 2016
- [j16]Oded Berman, Jörg Kalcsics, Dmitry Krass:
On covering location problems on networks with edge demand. Comput. Oper. Res. 74: 214-227 (2016) - [j15]Cristina Núñez-del-Toro, Elena Fernández, Jörg Kalcsics, Stefan Nickel:
Scheduling policies for multi-period services. Eur. J. Oper. Res. 251(3): 751-770 (2016) - 2015
- [j14]Igor Averbakh, Oded Berman, Jörg Kalcsics, Dmitry Krass:
Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand. Oper. Res. 63(2): 394-411 (2015) - [j13]Jörg Kalcsics, Stefan Nickel, Justo Puerto, Antonio M. Rodríguez-Chía:
Several 2-facility location problems on networks with equity objectives. Networks 65(1): 1-9 (2015) - 2014
- [j12]Jörg Kalcsics, Stefan Nickel, Miguel A. Pozo, Justo Puerto, Antonio M. Rodríguez-Chía:
The multicriteria p-facility median location problem on networks. Eur. J. Oper. Res. 235(3): 484-493 (2014) - [j11]Alexander Butsch, Jörg Kalcsics, Gilbert Laporte:
Districting for Arc Routing. INFORMS J. Comput. 26(4): 809-824 (2014) - [j10]Igor Averbakh, Oded Berman, Dmitry Krass, Jörg Kalcsics, Stefan Nickel:
Cooperative covering problems on networks. Networks 63(4): 334-349 (2014) - 2011
- [j9]Jörg Kalcsics:
Improved complexity results for several multifacility location problems on trees. Ann. Oper. Res. 191(1): 23-36 (2011) - [j8]Jörg Kalcsics:
The multi-facility median problem with Pos/Neg weights on general graphs. Comput. Oper. Res. 38(3): 674-682 (2011) - 2010
- [j7]Jörg Kalcsics, Stefan Nickel, Justo Puerto, Antonio M. Rodríguez-Chía:
Distribution systems design with role dependent objectives. Eur. J. Oper. Res. 202(2): 491-501 (2010) - [j6]Elena Fernández, Jörg Kalcsics, Stefan Nickel, Roger Z. Ríos-Mercado:
A novel maximum dispersion territory design model arising in the implementation of the WEEE-directive. J. Oper. Res. Soc. 61(3): 503-514 (2010)
2000 – 2009
- 2009
- [j5]Oded Berman, Jörg Kalcsics, Dmitry Krass, Stefan Nickel:
The Ordered Gradual Covering Location Problem on a Network. Discret. Appl. Math. 157(18): 3689-3707 (2009) - 2008
- [j4]Yolanda Hinojosa, Jörg Kalcsics, Stefan Nickel, Justo Puerto, Sebastian Velten:
Dynamic supply chain design with inventory. Comput. Oper. Res. 35(2): 373-391 (2008) - [j3]S. Arifusalem, Stefano Benati, Brian Boffey, Teresa Cáceres, Dietmar Cieslik, Zvi Drezner, Horst A. Eiselt, Ioannis Giannikos, Horst W. Hamacher, John M. Hodgson, Jörg Kalcsics, Kathrin Klamroth, Olivier Klopfenstein, Mercedes Landete, Maria Cruz López de los Mozos Martin, Alfredo Marín, Juan A. Mesa, Malick M. Ndiaye, Stefan Nickel, Blas Pelegrín:
New trends in locational analysis. Comput. Oper. Res. 35(3): 649-650 (2008) - [e1]Jörg Kalcsics, Stefan Nickel:
Operations Research, Proceedings 2007, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Saarbrücken, Germany, September 5-7, 2007. Operations Research Proceedings, Springer 2008, ISBN 978-3-540-77902-5 [contents] - 2007
- [c2]Rodrigo Herrera, Jörg Kalcsics, Stefan Nickel:
Reliability Models for the Uncapacitated Facility Location Problem with User Preferences. OR 2007: 135-140 - 2003
- [j2]Jörg Kalcsics, Stefan Nickel, Justo Puerto:
Multifacility ordered median problems on networks: A further analysis. Networks 41(1): 1-12 (2003) - 2002
- [j1]Jörg Kalcsics, Stefan Nickel, Justo Puerto, Arie Tamir:
Algorithmic results for ordered median problems. Oper. Res. Lett. 30(3): 149-158 (2002) - [c1]Jörg Kalcsics, M. Teresa Melo, Stefan Nickel:
Mathematical Programming Models for Strategic Supply Chain Planning and Design. OR 2002: 108-113
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-10-30 20:31 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:
