GitHub / guyez / Present-Wrapping-Problem
CP and SMT model to solve the Present Wrapping Problem (PWP): given a wrapping paper roll of a certain dimen- sion and a list of presents, decide how to cut off pieces of paper so that all the presents can be wrapped. Consider that each present is described by the dimensions of the piece of paper needed to wrap it. Moreover, each necessary piece of paper cannot be rotated when cutting off, to respect the direction of the patterns in the paper.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/guyez%2FPresent-Wrapping-Problem
Stars: 1
Forks: 0
Open issues: 0
License: None
Language: Python
Size: 196 KB
Dependencies parsed at: Pending
Created at: almost 5 years ago
Updated at: over 1 year ago
Pushed at: almost 5 years ago
Last synced at: 4 months ago
Topics: constraint-programming, constraint-propagation, minizinc, sat-solver, smt, smtlibv2, z3, z3-smt-solver