Publications

Author

Title

Year sorteringsordning

Fulltext

Jäger, Gerold

An Optimal Strategy for Static Mastermind with Two Pegs
Proceedings of 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2016): 670-682

2016

-

Jäger, Gerold
Peczarski, Marcin

Bounding memory for Mastermind might not make it harder
Theoretical Computer Science, 596: 55-66

2015

-

Shcherbak, Denys
Jäger, Gerold
Öhman, Lars-Daniel

The Zero Forcing Number of Bijection Graphs
Proceedings of 26th International Workshop om Combinatorial Algorithms (IWOCA 2015): 334-345

2015

-

Jäger, Gerold
Arnold, Florian

SAT and IP Based Algorithms for Magic Labeling Including a Complete Search for Total Magic Labelings
Journal of Discrete Algorithms, 31: 87-103

2015

-

Jäger, Gerold
Peczarski, Marcin

The worst case number of questions in Generalized AB game with and without white-peg answers
Discrete Applied Mathematics, 184: 20-31

2015

-

Jäger, Gerold
Peczarski, Marcin

Playing several variants of mastermind with constant-size memory is not harder than with unbounded memory
Combinatorial Algorithms: 188-199

2015

-

Fischer, Anja
Fischer, Frank
Jäger, Gerold; et al.

Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesman Problem
Computation, 3(2): 285-298

2015

Download

Baltz, Andreas
El Ouali, Mourad
Jäger, Gerold; et al.

Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection
Journal of the Operational Research Society, 66(4): 615-626

2015

-

Fischer, Anja
Fischer, Frank
Jäger, Gerold; et al.

Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics
Discrete Applied Mathematics, 166: 97-114

2014

-

Jäger, Gerold
Dong, Changxing
Goldengorin, Boris; et al.

A backbone based TSP heuristic for large instances
Journal of Heuristics, 20(1): 107-124

2014

-


Page Editor: Åsa Nordström

Print page