Jörg Kalcsics

Orcid: 0000-0002-5013-3448

According to our database1, Jörg Kalcsics authored at least 35 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the complexity of the upgrading version of the maximal covering location problem.
Networks, June, 2024

New Algorithms for Hierarchical Optimization in Kidney Exchange Programs.
Oper. Res., 2024

A Graph Reinforcement Learning Framework for Neural Adaptive Large Neighbourhood Search.
Comput. Oper. Res., 2024

2023
Competitive location problems: balanced facility location and the One-Round Manhattan Voronoi Game.
Ann. Oper. Res., February, 2023

Optimising portfolio diversification and dimensionality.
J. Glob. Optim., 2023

Proceedings of the XII International Workshop on Locational Analysis and Related Problems.
CoRR, 2023

GRAPH Reinforcement Learning for Operator Selection in the ALNS Metaheuristic.
Proceedings of the Optimization and Learning - 6th International Conference, 2023

2022
Conditional facility location problems with continuous demand and a polygonal barrier.
Eur. J. Oper. Res., 2022

Upgrading edges in the maximal covering location problem.
Eur. J. Oper. Res., 2022

Improved instance generation for kidney exchange programmes.
Comput. Oper. Res., 2022

2021
Location problems with continuous demand and unreliable facilities: Applications of families of incremental Voronoi diagrams.
Discret. Appl. Math., 2021

Improving solution times for stable matching problems through preprocessing.
Comput. Oper. Res., 2021

Minmax regret maximal covering location problems with edge demands.
Comput. Oper. Res., 2021

2019
A multi-period multi-criteria districting problem applied to primary care scheme with gradual assignment.
Int. Trans. Oper. Res., 2019

Mathematical models for stable matching problems with ties and incomplete lists.
Eur. J. Oper. Res., 2019

2018
A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design.
Eur. J. Oper. Res., 2018

2017
A branch-and-price algorithm for the Aperiodic Multi-Period Service Scheduling Problem.
Eur. J. Oper. Res., 2017

2016
Scheduling policies for multi-period services.
Eur. J. Oper. Res., 2016

On covering location problems on networks with edge demand.
Comput. Oper. Res., 2016

2015
Several 2-facility location problems on networks with equity objectives.
Networks, 2015

Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand.
Oper. Res., 2015

2014
Cooperative covering problems on networks.
Networks, 2014

Districting for Arc Routing.
INFORMS J. Comput., 2014

The multicriteria p-facility median location problem on networks.
Eur. J. Oper. Res., 2014

2011
The multi-facility median problem with Pos/Neg weights on general graphs.
Comput. Oper. Res., 2011

Improved complexity results for several multifacility location problems on trees.
Ann. Oper. Res., 2011

2010
A novel maximum dispersion territory design model arising in the implementation of the WEEE-directive.
J. Oper. Res. Soc., 2010

Distribution systems design with role dependent objectives.
Eur. J. Oper. Res., 2010

2009
The Ordered Gradual Covering Location Problem on a Network.
Discret. Appl. Math., 2009

2008
Dynamic supply chain design with inventory.
Comput. Oper. Res., 2008

New trends in locational analysis.
Comput. Oper. Res., 2008

2007
Reliability Models for the Uncapacitated Facility Location Problem with User Preferences.
Proceedings of the Operations Research, 2007

2003
Multifacility ordered median problems on networks: A further analysis.
Networks, 2003

2002
Algorithmic results for ordered median problems.
Oper. Res. Lett., 2002

Mathematical Programming Models for Strategic Supply Chain Planning and Design.
Proceedings of the Operations Research Proceedings 2002, 2002


  Loading...