Jannis Kurtz

Orcid: 0000-0003-1570-7044

According to our database1, Jannis Kurtz authored at least 21 papers between 2016 and 2024.

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

2024
From Large Language Models and Optimization to Decision Optimization CoPilot: A Research Manifesto.
CoRR, 2024

Neur2BiLO: Neural Bilevel Optimization.
CoRR, 2024

2023
Neur2RO: Neural Two-Stage Robust Optimization.
CoRR, 2023

Finding Regions of Counterfactual Explanations via Robust Optimization.
CoRR, 2023

Data-driven robust optimization using deep neural networks.
Comput. Oper. Res., 2023

2022
Data-driven Prediction of Relevant Scenarios for Robust Optimization.
CoRR, 2022

Ensemble Methods for Robust Support Vector Machines using Integer Programming.
CoRR, 2022

2021
Discrete optimization methods for group model selection in compressed sensing.
Math. Program., 2021

Efficient and Robust Mixed-Integer Optimization Methods for Training Binarized Deep Neural Networks.
CoRR, 2021

New complexity results and algorithms for min-max-min robust combinatorial optimization.
CoRR, 2021

2020
A Robust Approach to the Capacitated Vehicle Routing Problem with Uncertain Costs.
INFORMS J. Optim., January, 2020

Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty.
Discret. Appl. Math., 2020

Data-Driven Robust Optimization using Unsupervised Deep Learning.
CoRR, 2020

An Integer Programming Approach to Deep Neural Networks with Binary Activation Functions.
CoRR, 2020

Oracle-based algorithms for binary two-stage robust optimization.
Comput. Optim. Appl., 2020

2019
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty.
Eur. J. Oper. Res., 2019

2018
Robust combinatorial optimization under budgeted-ellipsoidal uncertainty.
EURO J. Comput. Optim., 2018

Robust combinatorial optimization under convex and discrete cost uncertainty.
EURO J. Comput. Optim., 2018

Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty.
Discret. Optim., 2018

2017
Min-max-min robust combinatorial optimization.
Math. Program., 2017

2016
Min-max-min robustness: a new approach to combinatorial optimization under uncertainty based on multiple solutions.
Electron. Notes Discret. Math., 2016


  Loading...