<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>3459</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>23</pageFirst>
    <pageLast>35</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>11413</volume>
    <type>conferenceobject</type>
    <publisherName>Springer International Publishing</publisherName>
    <publisherPlace>Cham</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Assessing Solution Quality of 3SAT on a Quantum Annealing Platform</title>
    <parentTitle language="eng">Quantum Technology and Optimization Problems : First International Workshop, QTOP 2019, Munich, Germany, March 18, 2019, Proceedings</parentTitle>
    <identifier type="isbn">978-3-030-14081-6</identifier>
    <identifier type="doi">10.1007/978-3-030-14082-3_3</identifier>
    <enrichment key="opus.import.date">2022-04-10T09:34:41+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="OtherSeries">Lecture Notes in Computer Science ; 11413</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Keine Lizenz - Es gilt das deutsche Urheberrecht: § 53 UrhG</licence>
    <author>Thomas Gabor</author>
    <author>Sebastian Zielinski</author>
    <author>Sebastian Feld</author>
    <author>Christoph Roch</author>
    <author>Christian Seidel</author>
    <author>Florian Neukart</author>
    <author>Isabella Galter</author>
    <author>Wolfgang Mauerer</author>
    <author>Claudia Linnhoff-Popien</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
  <doc>
    <id>2642</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>13</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>6</volume>
    <type>article</type>
    <publisherName>Frontiers</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Hybrid Solution Method for the Capacitated Vehicle Routing Problem Using a Quantum Annealer</title>
    <abstract language="eng">he Capacitated Vehicle Routing Problem (CVRP) is an NP-optimization problem (NPO) that has been of great interest for decades for both, science and industry. The CVRP is a variant of the vehicle routing problem characterized by capacity constrained vehicles. The aim is to plan tours for vehicles to supply a given number of customers as efficiently as possible. The problem is the combinatorial explosion of possible solutions, which increases superexponentially with the number of customers. Classical solutions provide good approximations to the globally optimal solution. D-Wave's quantum annealer is a machine designed to solve optimization problems. This machine uses quantum effects to speed up computation time compared to classic computers. The problem on solving the CVRP on the quantum annealer is the particular formulation of the optimization problem. For this, it has to be mapped onto a quadratic unconstrained binary optimization (QUBO) problem. Complex optimization problems such as the CVRP can be translated to smaller subproblems and thus enable a sequential solution of the partitioned problem. This work presents a quantum-classic hybrid solution method for the CVRP. It clarifies whether the implementation of such a method pays off in comparison to existing classical solution methods regarding computation time and solution quality. Several approaches to solving the CVRP are elaborated, the arising problems are discussed, and the results are evaluated in terms of solution quality and computation time.</abstract>
    <parentTitle language="eng">Frontiers in ICT</parentTitle>
    <identifier type="doi">10.3389/fict.2019.00013</identifier>
    <enrichment key="opus.import.date">2022-01-28T13:58:12+00:00</enrichment>
    <enrichment key="opus.source">sword</enrichment>
    <enrichment key="opus.import.user">importuser</enrichment>
    <enrichment key="BegutachtungStatus">peer-reviewed</enrichment>
    <licence>Creative Commons - CC BY - Namensnennung 4.0 International</licence>
    <author>Sebastian Feld</author>
    <author>Christoph Roch</author>
    <author>Thomas Gabor</author>
    <author>Christian Seidel</author>
    <author>Florian Neukart</author>
    <author>Isabella Galter</author>
    <author>Wolfgang Mauerer</author>
    <author>Claudia Linnhoff-Popien</author>
    <collection role="institutes" number="FakIM">Fakultät Informatik und Mathematik</collection>
    <collection role="oaweg" number="">Gold Open Access- Erstveröffentlichung in einem/als Open-Access-Medium</collection>
    <collection role="othforschungsschwerpunkt" number="16311">Digitalisierung</collection>
    <collection role="institutes" number="">Labor für Digitalisierung (LFD)</collection>
  </doc>
</export-example>
