\newacronym[see={[Glossary:]{gls-ampl}}]{ampl}{AMPL\glsadd{gls-cbls}}{A
  Mathematical Programming Language}

\newacronym[see={[Glossary:]{gls-ast}}]{ast}{AST\glsadd{gls-ast}}{Abstract
  Syntax Tree}

\newacronym[see={[Glossary:]{gls-cbls}}]{cbls}{CBLS\glsadd{gls-cbls}}{Constraint-Based
  Local Search}

\newacronym[see={[Glossary:]{gls-chr}}]{chr}{CHR\glsadd{gls-chr}}{Constraint
  Handling Rules}

\newacronym[see={[Glossary:]{gls-clp}}]{clp}{CLP\glsadd{gls-clp}}{Constraint
  Logic Programming}

\newacronym[see={[Glossary:]{gls-cp}}]{cp}{CP\glsadd{gls-cp}}{Constraint
  Programming}

\newacronym[see={[Glossary:]{gls-cse}}]{cse}{CSE\glsadd{gls-cse}}{Common
  Sub-expression Elimination}

\newacronym[see={[Glossary:]{gls-csp}}]{csp}{CSP\glsadd{gls-csp}}{Constraint
  Satisfaction Problem}

\newacronym{cnf}{CNF}{Conjunctive Normal Form}

\newacronym[see={[Glossary:]{gls-cop}}]{cop}{COP\glsadd{gls-cop}}{Constraint
  Optimisation Problem}

\newacronym{cpu}{CPU}{Central Processing Unit}

\newacronym[see={[Glossary:]{gls-gbac}}]{gbac}{GBAC\glsadd{gls-gbac}}{Generalised
  Balanced Academic Curriculum}

\newacronym[see={[Glossary:]{gls-lcg}}]{lcg}{LCG\glsadd{gls-lcg}}{Lazy Clause
  Generation}

\newacronym[see={[Glossary:]{gls-lns}}]{lns}{LNS\glsadd{gls-lns}}{Large
  Neighbourhood Search}

\newacronym{lp}{LP}{Linear Programming}

\newacronym{maxsat}{MAX-SAT}{Maximum Satisfiability}

\newacronym[see={[Glossary:]{gls-mip}}]{mip}{MIP\glsadd{gls-mip}}{Mixed Integer
  Programming}

\newacronym{np}{NP}{Nondeterministic Polynomial-time}

\newacronym[see={[Glossary:]{gls-opl}}]{opl}{OPL\glsadd{gls-opl}}{The
  Optimisation Programming Language}

\newacronym{ram}{RAM}{Random Access Memory}

\newacronym[see={[Glossary:]{gls-sat}}]{sat}{SAT\glsadd{gls-sat}}{Boolean
  Satisfiability}

\newacronym[see={[Glossary:]{gls-trs}}]{trs}{TRS\glsadd{gls-trs}}{Term Rewriting
  System}

\newacronym{tsp}{TSP\glsadd{gls-trs}}{Travelling Salesperson Problem}