Badges
0
0
0
Next badge
0/1
Impact
~94
people reached
- 0 posts edited
- 0 helpful flags
- 0 votes cast
Oct
14 |
comment |
Metaheuristics and feasability
Let us consider a simple and connected graph $\mathcal{G}=(\mathcal{V},\mathcal{E})$, a finite set $\mathcal{C}=\{1,\ldots,k\}$ and a scoring function $\phi : \mathcal{C} \rightarrow \mathbb{N}$. Then, my problem can be stated as follows: find an assignment $x \in \mathcal{C}^\mathcal{V}$ such that each node has a value in $c \in \mathcal{C}$ and has at least one neighboring node with value $d$, $\forall d<c$. |
Oct
13 |
asked | Metaheuristics and feasability |