arXiv (All)
open access
Polyhedral Methods for Cooperative Games: Small Lifts and Hard Faces
We study the computational complexity of fundamental algorithmic problems -- membership testing, separation, valid-inequality testing, and linear optimization -- over polytopes and cones arising from cooperative games (also known as pseudo-Boolean functions). A central obstacle in the study of such
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
- Formulating Multistage Cutting Stock Problems as QUBO#1083546
- An Adaptive Computational Framework for Structural Shape Optimization: Deterministic and Robust Formulations#1040206
- Symbolic Constraints in Polyhedral Enclosure and Tetrahedral Decomposition in Genus-0 Polyhedra#1118411
- A 2.37332-Competitive Algorithm for Online Square Packing with Gravity#997016
- A 3.1462-Competitive Algorithm for Matroid Secretary#1160784
Record · ID 1051003
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