Optimal solving of a binary knapsack problem on a D-Wave quantum machine and its implementation in production systems
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
Optimal solving of a binary knapsack problem on a D-Wave quantum machine and its implementation in production systems ; day:13 ; month:5 ; year:2024 ; pages:1-16
Annals of operations research ; (13.5.2024), 1-16
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10479-024-06025-1
- URN
-
urn:nbn:de:101:1-2407222117580.484542436442
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:53 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Bożejko, Wojciech
- Burduk, Anna
- Pempera, Jarosław
- Uchroński, Mariusz
- Wodecki, Mieczysław
- SpringerLink (Online service)
Other Objects (12)
New binary bat algorithm for solving 0–1 knapsack problem
Solving knapsack problems using a binary gaining sharing knowledge-based optimization algorithm
Solving a Binary Puzzle
Solving the knapsack problem with recursive queries and PostgreSQL
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
"A.Y.H. Knapsack"
Knapsack, St. Josef
Solving unconstrained binary polynomial programs with limited reach : Application to low autocorrelation binary sequences
Solving the large-scale knapsack feasibility problem using a distributed computation approach to integer programming
Verfahren zur Herstellung von Vinylchlorid.- Anmelder: Knapsack AG, Knapsack/Köln, BRD
Die Umsiedlung von Knapsack
Algorithmen zum Knapsack-Problem
New binary bat algorithm for solving 0–1 knapsack problem
Solving knapsack problems using a binary gaining sharing knowledge-based optimization algorithm
Solving a Binary Puzzle
Solving the knapsack problem with recursive queries and PostgreSQL
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
"A.Y.H. Knapsack"
Knapsack, St. Josef
Solving unconstrained binary polynomial programs with limited reach : Application to low autocorrelation binary sequences
Solving the large-scale knapsack feasibility problem using a distributed computation approach to integer programming
Verfahren zur Herstellung von Vinylchlorid.- Anmelder: Knapsack AG, Knapsack/Köln, BRD
Die Umsiedlung von Knapsack
Algorithmen zum Knapsack-Problem
New binary bat algorithm for solving 0–1 knapsack problem
Solving knapsack problems using a binary gaining sharing knowledge-based optimization algorithm
Solving a Binary Puzzle
Solving the knapsack problem with recursive queries and PostgreSQL
Knapsack, Zweigpostamt Knapsack, Großgemeinde Hürth
"A.Y.H. Knapsack"
Knapsack, St. Josef
Solving unconstrained binary polynomial programs with limited reach : Application to low autocorrelation binary sequences
Solving the large-scale knapsack feasibility problem using a distributed computation approach to integer programming
Verfahren zur Herstellung von Vinylchlorid.- Anmelder: Knapsack AG, Knapsack/Köln, BRD
Die Umsiedlung von Knapsack