arXiv (All)
open access
A scenario-cluster-based and enhanced progressive hedging algorithm for the two-stage stochastic quadratic knapsack problem
This paper introduces the two-stage stochastic quadratic knapsack problem (TSSQKP) with uncertainty in profits and weights. To overcome the computational difficulties arising from the combined stochastic, binary, and quadratic structure, we propose a solution framework that integrates an adaptation
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
- New Upper bounds on the Mondrian Art Problem#822406
- Knapsack problem -- NP-complete despite dynamic programming solution?#796571
- A variable neighborhood search approach for cyclic bandwidth sum problem#243775
- Two Knapsacks: A Novel of Canadian Summer Life#39141
- Exact Methods for Solving k-Delete Recoverable Robust 0-1 Problems Under Budgeted Uncertainty#1077407
Record · ID 1048921
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