Solving the Two-dimensional single stock size Cuting Stock Problem with SAT and MaxSAT
Solving the Two-dimensional single stock size Cuting Stock Problem with SAT and MaxSAT explores A SAT-based framework for optimizing the 2D cutting stock problem, outperforming existing solvers on benchmark instances.. Commercial viability score: 4/10 in Operations Research / Optimization.
Updated 7 hours ago
BUILDER'S SANDBOX
Build This Paper
Use an AI coding agent to implement this research.
OpenAI CodexAI Agent
Lightweight coding agent in your terminal.
Claude CodeAI Agent
Agentic coding tool for terminal workflows.
AntiGravity IDEScaffolding
AI agent mindset installer and workflow scaffolder.
CursorIDE
AI-first code editor built on VS Code.
VS CodeIDE
Free, open-source editor by Microsoft.
Recommended Stack
Startup Essentials
Estimated $9K - $13K over 6-10 weeks.
See exactly what it costs to build this -- with 3 comparable funded startups.
7-day free trial. Cancel anytime.
Discover the researchers behind this paper and find similar experts.
7-day free trial. Cancel anytime.
Related Papers
- Builds On ThisPortfolio of Solving Strategies in CEGAR-based Object Packing and Scheduling for Sequential 3D PrintingViability: 3.0
- Builds On ThisConstruct, Merge, Solve & Adapt with Reinforcement Learning for the min-max Multiple Traveling Salesman ProblemViability: 3.0
- Builds On ThisEfficient Constraint Generation for Stochastic Shortest Path ProblemsViability: 3.0
- Prior WorkThe Multi-AMR Buffer Storage, Retrieval, and Reshuffling Problem: Exact and Heuristic ApproachesViability: 4.0
- Higher ViabilityScalable Floating-Point Satisfiability via Staged Optimization