% IMPORTANT: The following is UTF-8 encoded.  This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.

@MASTERSTHESIS{Tsakalias:1038364,
      author       = {Tsakalias, Nikolaos},
      othercontributors = {Willsch, Dennis and Montanez-Barrera, Jhon Alejandro},
      title        = {{C}omparing different formulations to solve the {T}raveling
                      {S}alesman {P}roblem on a {Q}uantum {C}omputer},
      school       = {Rheinisch-Westfälische Technische Hochschule Aachen},
      type         = {Bachelorarbeit},
      reportid     = {FZJ-2025-01361},
      pages        = {42},
      year         = {2023},
      note         = {Bachelorarbeit, Rheinisch-Westfälische Technische
                      Hochschule Aachen, 2023},
      abstract     = {Quantum Computing is an emerging technology. This means
                      that many of the details of thisfield are still unexplored.
                      For example, when trying to solve a problem on a classical
                      computer,there often exists a well-established, preferable
                      method of doing it. This is often not the casewhen using a
                      quantum computer. This Bachelor’s Thesis will focus on the
                      Traveling SalesmanProblem, a famous optimization problem
                      with a lot of real applications, ranging from
                      efficientpackage delivery to genome map assembly and guiding
                      industrial machines. Different ways ofencoding and solving
                      the problem on a quantum computer will be compared. This is
                      done in hopeof determining whether a preferable encoding
                      exists for the TSP. The result could also shed somelight on
                      the encoding of other optimization problems.},
      cin          = {JSC},
      cid          = {I:(DE-Juel1)JSC-20090406},
      pnm          = {5111 - Domain-Specific Simulation $\&$ Data Life Cycle Labs
                      (SDLs) and Research Groups (POF4-511)},
      pid          = {G:(DE-HGF)POF4-5111},
      typ          = {PUB:(DE-HGF)2},
      doi          = {10.34734/FZJ-2025-01361},
      url          = {https://juser.fz-juelich.de/record/1038364},
}