Aperta
metadata only
CC BY 4.0
QUBO Formulations and Characterization of Penalty Parameters for the Multi-Knapsack Problem
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Resource-Efficient QUBO Formulation for Anchored Currency Arbitrage#617018
- Resource-Efficient QUBO Formulation for Anchored Currency Arbitrage#616518
- Introduction to QUDO, Tensor QUDO and HOBO formulations: Qudits, Equivalences, Knapsack Problem, Traveling Salesman Problem and Combinatorial Games#189316
- Solving Multiple Discretization Portfolio Optimization Problem with Quantum-Classical Hybrid Algorithms#299215
- Judgement aggregation under constraints#720303
Record · ID 417120
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive