notxia/unibo-ai-notes
1
0
Fork 0
mirror of https://github.com/NotXia/unibo-ai-notes.git synced 2025-12-15 19:12:22 +01:00
Code Issues Packages Projects Releases Wiki Activity

Fix missing margin notes

Browse Source
This commit is contained in:
Tian Cheng (Riccardo) Xia
2024-03-01 15:34:25 +01:00
parent a41293d415
commit 156827bc83
1 changed files with 8 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
src/combinatorial-decision-making-and-optimization/sections/_constraint_programming.tex
View File

@ -388,16 +388,16 @@ Define constraints in an extensive way.
\item[Fail-first (FF)] \marginnote{Fail-first (FF)} \item[Fail-first (FF)] \marginnote{Fail-first (FF)}
Try the variables that are most likely to fail in order to maximize propagation. Try the variables that are most likely to fail in order to maximize propagation.
\begin{description} \begin{description}
\item[Minimum domain] \item[Minimum domain] \marginnote{Minimum domain}
Assign the variable with the minimum domain size. Assign the variable with the minimum domain size.
\item[Most constrained] \item[Most constrained] \marginnote{Most constrained}
Assign the variable with the maximum degree (i.e. number of constraints that involve it). Assign the variable with the maximum degree (i.e. number of constraints that involve it).
\item[Combination] \item[Combination] \marginnote{Combination}
Combine both minimum domain and most constrained to minimize the value $\frac{\text{domain size}}{\text{degree}}$. Combine both minimum domain and most constrained to minimize the value $\frac{\text{domain size}}{\text{degree}}$.
\item[Weighted degree] \item[Weighted degree] \marginnote{Weighted degree}
Each constraint $C$ starts with a weight $w(C) = 1$. Each constraint $C$ starts with a weight $w(C) = 1$.
During propagation, when a constraint $C$ fails, its weight is increased by 1. During propagation, when a constraint $C$ fails, its weight is increased by 1.
@ -412,14 +412,14 @@ Define constraints in an extensive way.
Instances of a problem that are particularly hard and expensive to solve. Instances of a problem that are particularly hard and expensive to solve.
\begin{description} \begin{description}
\item[Randomization] \item[Randomization] \marginnote{Randomization}
Sometimes, make a random choice: Sometimes, make a random choice:
\begin{itemize} \begin{itemize}
\item Randomly choose the variable or value to assign. \item Randomly choose the variable or value to assign.
\item Break ties randomly. \item Break ties randomly.
\end{itemize} \end{itemize}
\item[Restarting] \item[Restarting] \marginnote{Restarting}
Restart the search after a certain amount of resources (e.g. search steps) have been consumed. Restart the search after a certain amount of resources (e.g. search steps) have been consumed.
The new search can exploit past knowledge, change heuristics, or use randomization. The new search can exploit past knowledge, change heuristics, or use randomization.
@ -462,7 +462,7 @@ Define constraints in an extensive way.
\subsection{Constraint optimization problems} \subsection{Constraint optimization problems}
\begin{description} \begin{description}
\item[Branch and bound] \item[Branch and bound] \marginnote{Branch and bound}
Solves a COP by solving a sequence of CSPs. Solves a COP by solving a sequence of CSPs.
\begin{enumerate} \begin{enumerate}
\item Find a feasible solution and add a bounding constraint \item Find a feasible solution and add a bounding constraint
@ -474,6 +474,7 @@ Define constraints in an extensive way.
\subsection{Local neighborhood search (LNS)} \subsection{Local neighborhood search (LNS)}
\marginnote{Local neighborhood search (LNS)}
Hybrid between constraint programming and heuristic search. Hybrid between constraint programming and heuristic search.
\begin{enumerate} \begin{enumerate}