Luca E. Schäfer

Orcid: 0000-0003-0454-0234

According to our database1, Luca E. Schäfer authored at least 10 papers between 2019 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
p-median location interdiction on trees.
CoRR, 2023

2022
A machine learning based algorithm selection method to solve the minimum cost flow problem.
CoRR, 2022

2021
The binary knapsack problem with qualitative levels.
Eur. J. Oper. Res., 2021

2020
Shortest paths with ordinal weights.
Eur. J. Oper. Res., 2020

Introducing multiobjective complex systems.
Eur. J. Oper. Res., 2020

On the Bicriterion Maximum Flow Network Interdiction Problem.
CoRR, 2020

The two player shortest path network interdiction problem.
CoRR, 2020

The {0, 1}-knapsack problem with qualitative levels.
CoRR, 2020

2019
On the Universal Near-Shortest Simple Paths Problem.
CoRR, 2019

The Bicriterion Maximum Flow Network Interdiction Problem in <i>s</i>-<i>t</i>-Planar Graphs.
Proceedings of the Operations Research Proceedings 2019, 2019


  Loading...