| Class Tree | |
|---|---|
| Description |
The minimum postage stamp problem asks for a minimal set of stamp types that allow to combine all postage values from 1 to a specified bound, when an envelope can hold only a limited number of stamps. Specify bound and limit for an instance. |
| Submitter | Oliver Matheis |
| Compatible Encodings | |
| Output Predicates |
|
| Instances 1 - 6 of 6 |
|
Expand All
Collapse All
