Skip to content
This repository has been archived by the owner on May 7, 2023. It is now read-only.

Commit

Permalink
Improve phrasing
Browse files Browse the repository at this point in the history
  • Loading branch information
IEncinas10 committed Nov 24, 2022
1 parent d4918fd commit eae2751
Show file tree
Hide file tree
Showing 2 changed files with 1 addition and 1 deletion.
Binary file modified report/report.pdf
Binary file not shown.
2 changes: 1 addition & 1 deletion report/report.tex
Original file line number Diff line number Diff line change
Expand Up @@ -188,7 +188,7 @@ \subsection{Redundant constraints}

\section{Meta-heuristics}

As a solution must exist no matter which player rests in a given day, we will focus on assigning a rest day for every player $p$. This information is enough for calculating our objective function, performing local search and GRASP. After all this, we will determine the pairings for the whole tournament.
As a solution must exist no matter which player rests in any given day, we will focus on assigning a rest day for every player $p$. This information is enough for calculating our objective function, performing local search and GRASP. After all this, we will determine the pairings for the whole tournament.

\subsection{Constructive}

Expand Down

0 comments on commit eae2751

Please sign in to comment.