Mathematical Programming Models for Strategic Supply Chain Planning and Design. - Jörg Kalcsics; M. Teresa Melo; Stefan Nickel (OR, 2002)

Algorithmic results for ordered median problems. - Jörg Kalcsics; Stefan Nickel; Justo Puerto; Arie Tamir (Oper. Res. Lett., 2002)

Multifacility ordered median problems on networks: A further analysis. - Jörg Kalcsics; Stefan Nickel; Justo Puerto (Networks, 2003)

Reliability Models for the Uncapacitated Facility Location Problem with User Preferences. - Rodrigo Herrera; Jörg Kalcsics; Stefan Nickel (OR, 2007)

New trends in locational analysis. - 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; et al. (Comput. Oper. Res., 2008)

Dynamic supply chain design with inventory. - Yolanda Hinojosa; Jörg Kalcsics; Stefan Nickel; Justo Puerto; Sebastian Velten (Comput. Oper. Res., 2008)

The Ordered Gradual Covering Location Problem on a Network. - Oded Berman; Jörg Kalcsics; Dmitry Krass; Stefan Nickel (Discret. Appl. Math., 2009)

Distribution systems design with role dependent objectives. - Jörg Kalcsics; Stefan Nickel; Justo Puerto; Antonio M. Rodríguez-Chía (Eur. J. Oper. Res., 2010)

A novel maximum dispersion territory design model arising in the implementation of the WEEE-directive. - Elena Fernández 001; Jörg Kalcsics; Stefan Nickel; Roger Z. Ríos-Mercado (J. Oper. Res. Soc., 2010)

Improved complexity results for several multifacility location problems on trees. - Jörg Kalcsics (Ann. Oper. Res., 2011)

The multi-facility median problem with Pos/Neg weights on general graphs. - Jörg Kalcsics (Comput. Oper. Res., 2011)

The multicriteria p-facility median location problem on networks. - Jörg Kalcsics; Stefan Nickel; Miguel A. Pozo 001; Justo Puerto; Antonio M. Rodríguez-Chía (Eur. J. Oper. Res., 2014)

Districting for Arc Routing. - Alexander Butsch; Jörg Kalcsics; Gilbert Laporte (INFORMS J. Comput., 2014)

Cooperative covering problems on networks. - Igor Averbakh; Oded Berman; Dmitry Krass; Jörg Kalcsics; Stefan Nickel (Networks, 2014)

Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand. - Igor Averbakh; Oded Berman; Jörg Kalcsics; Dmitry Krass (Oper. Res., 2015)

Several 2-facility location problems on networks with equity objectives. - Jörg Kalcsics; Stefan Nickel; Justo Puerto; Antonio M. Rodríguez-Chía (Networks, 2015)

On covering location problems on networks with edge demand. - Oded Berman; Jörg Kalcsics; Dmitry Krass (Comput. Oper. Res., 2016)

Scheduling policies for multi-period services. - Cristina Núñez-del-Toro; Elena Fernández 001; Jörg Kalcsics; Stefan Nickel (Eur. J. Oper. Res., 2016)

A branch-and-price algorithm for the Aperiodic Multi-Period Service Scheduling Problem. - Elena Fernández 001; Jörg Kalcsics; Cristina Núñez-del-Toro (Eur. J. Oper. Res., 2017)

A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design. - Matthias Bender 002; Jörg Kalcsics; Stefan Nickel; Martin Pouls (Eur. J. Oper. Res., 2018)

Mathematical models for stable matching problems with ties and incomplete lists. - Maxence Delorme; Sergio García 001; Jacek Gondzio; Jörg Kalcsics; David F. Manlove; William Pettersson (Eur. J. Oper. Res., 2019)

A multi-period multi-criteria districting problem applied to primary care scheme with gradual assignment. - Seda Yanik; Jörg Kalcsics; Stefan Nickel; Burçin Bozkaya (Int. Trans. Oper. Res., 2019)

Minmax regret maximal covering location problems with edge demands. - Marta Baldomero-Naranjo; Jörg Kalcsics; Antonio M. Rodríguez-Chía (Comput. Oper. Res., 2021)

Improving solution times for stable matching problems through preprocessing. - William Pettersson; Maxence Delorme; Sergio García 001; Jacek Gondzio; Jörg Kalcsics; David F. Manlove (Comput. Oper. Res., 2021)

Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams. - Igor Averbakh; Oded Berman; Jörg Kalcsics; Dmitry Krass (Discret. Appl. Math., 2021)

Improved instance generation for kidney exchange programmes. - Maxence Delorme; Sergio García 001; Jacek Gondzio; Jörg Kalcsics; David F. Manlove; William Pettersson; James Trimble 001 (Comput. Oper. Res., 2022)

Upgrading edges in the maximal covering location problem. - Marta Baldomero-Naranjo; Jörg Kalcsics; Alfredo Marín 001; Antonio M. Rodríguez-Chía (Eur. J. Oper. Res., 2022)

Conditional facility location problems with continuous demand and a polygonal barrier. - Thomas Byrne; Jörg Kalcsics (Eur. J. Oper. Res., 2022)

GRAPH Reinforcement Learning for Operator Selection in the ALNS Metaheuristic. - Syu-Ning Johnn; Victor-Alexandru Darvariu; Julia Handl; Jörg Kalcsics (OLA, 2023)

Proceedings of the XII International Workshop on Locational Analysis and Related Problems. - Marta Baldomero-Naranjo; Víctor Blanco; Sergio García 001; Ricardo Gázquez; Jörg Kalcsics; Luisa I. Martínez-Merino; Juan Manuel Muñoz-Ocaña; Francisco Temprano; Alberto Torrejón (CoRR, 2023)

Optimising portfolio diversification and dimensionality. - M. Barkhagen; Sergio García 001; Jacek Gondzio; Jörg Kalcsics; J. Kroeske; Sotirios Sabanis; A. Staal (J. Glob. Optim., 2023)

Competitive location problems: balanced facility location and the One-Round Manhattan Voronoi Game. - Thomas Byrne; Sándor P. Fekete; Jörg Kalcsics; Linda Kleist (Ann. Oper. Res., 2023)

A Graph Reinforcement Learning Framework for Neural Adaptive Large Neighbourhood Search. - Syu-Ning Johnn; Victor-Alexandru Darvariu; Julia Handl; Jörg Kalcsics (Comput. Oper. Res., 2024)

New Algorithms for Hierarchical Optimization in Kidney Exchange Programs. - Maxence Delorme; Sergio García 001; Jacek Gondzio; Jörg Kalcsics; David F. Manlove; William Pettersson (Oper. Res., 2024)

On the complexity of the upgrading version of the maximal covering location problem. - Marta Baldomero-Naranjo; Jörg Kalcsics; Antonio M. Rodríguez-Chía (Networks, 2024)

Edge downgrades in the maximal covering location problem. - Marta Baldomero-Naranjo; Jörg Kalcsics; Antonio M. Rodríguez-Chía (Comput. Oper. Res., 2025)