This project uses Google OR-Tools CP-SAT solver to create a daily activity schedule respecting time constraints, categories, and locations. Key features: Activities: Defined with durations, earliest ...

Executive Summary: Integer linear programming was applied to determine an optimal solution for assigning Indiana counties to one of nine congressional districts while meeting a set of five constraints ...

Abstract: Sample-efficient design space exploration (DSE) of complex CPS architectures remains a key challenge for identifying optimal configurations of components, design parameters and architectural ...

Abstract: Approximately linear phase FIR filters with reduced group delays are desirable in certain applications. Conventional design methods indirectly achieve the desired group delay by ...

can be solved by solving an equivalent linear complementarity problem when H is positive semidefinite. The approach is outlined in the discussion of the LCP subroutine in Chapter 17, "Language ...