Reproduce results from Garvie and Burkardt (Q7072067)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reproduce results from Garvie and Burkardt |
No description defined |
Statements
P1961 (Deleted Property)
deprecated Property P1961 not found, cannot determine the data type to use.
0 references
A **Snakemake** workflow that reproduces the optimal floor-tiling result of Garvie and Burkardt by formulating the combinatorial placement problem as an integer linear program and solving it with **SCIP**. The tiling problem involves placing a set of given tile shapes to cover a target floor region without overlap, and the workflow verifies that the computed optimal solution matches the objective value reported in the paper. The ILP formulation encodes adjacency, coverage, rotation, and reflection constraints through seven **Octave** helper functions, producing a compact LP file as input to the solver.\N\N### Main steps\N\N**generate_lp** — runs trinity_lp_alt.m in Octave with seven helper functions to produce trinity_alt.lp.\N\N**solve_lp** — passes the LP to SCIP, writing the verified optimal solution to trinity_sol.txt.
0 references
