Patrick Gemander

According to our database, Patrick Gemander authored at least 6 papers between 2018 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

EETTlib - Energy-efficient train timetabling library.

Andreas Bärmann, Patrick Gemander, Lukas Hager, Frederik Nöth, Oskar Schneider

Networks, January, 2023

Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph.

Andreas Bärmann, Patrick Gemander, Maximilian Merkert, Ann-Kathrin Wiertz, Francisco Javier Zaragoza Martínez

Discret. Appl. Math., 2023

2022

On Recognizing Staircase Compatibility.

Andreas Bärmann, Patrick Gemander, Alexander Martin, Maximilian Merkert

J. Optim. Theory Appl., 2022

2020

Two-row and two-column mixed-integer presolve using hashing-based pairing methods.

Patrick Gemander, Weikun Chen, Dieter Weninger, Leona Gottwald, Ambros M. Gleixner, Alexander Martin

EURO J. Comput. Optim., 2020

The clique problem with multiple-choice constraints under a cycle-free dependency graph.

Andreas Bärmann, Patrick Gemander, Maximilian Merkert

Discret. Appl. Math., 2020

2018

On a Polynomially Solvable Subclass of the Clique Problem with Applications in Energy-Efficient Timetabling.

Patrick Gemander

Proceedings of the Operations Research Proceedings 2018, 2018