arXiv (OAI Expanded)
open access
Formulating Multistage Cutting Stock Problems as QUBO
Cutting stock problems are of large relevance to a variety of industry branches. Here, we present a linear programming formulation for a restricted version of the multistage 2D cutting stock problem with Guillotine cuts and test it on published benchmark instances. After this, we derive a non-exact
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
- Characterizing QUBO Reformulations of the Max-k-Cut Problem for Quantum Computing#999686
- Decomposition Pipeline for Large-Scale Portfolio Optimization with Applications to Near-Term Quantum Computing#999626
- Multi-objective optimisation applied to industrial energy problems#456707
- Sylvester simplices: Triangulations and Ehrhart-theoretic aspects#1049446
- A Separation between Full-Rank PVM and Assumption-free Self-Testing#996811
Record · ID 1083546
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