An application of Constraint Programming and Satisfiability Modulo Theories to the NP-complete problem known as Optimal Rectangle Packing.
An application of Constraint Programming and Satisfiability Modulo Theories to the NP-complete problem known as Optimal Rectangle Packing.