test

Construction

This note is under construction.

Link

This note lacks links.

Citation

This note lacks citations.

Tag

This note lacks tags.

Storage

This note is not stored correctly.

There are two kinds of highlights, one being yellow highlights and one being read highlights.

There are two kinds of references, one using the BibTeX keys [1] and one using the standard Obsidian-flavored-markdown ^[2]. All references should use the IEEE conventions.

There is support for inline-LaTeX like $\frac{1}{2}$ and for LaTeX blocks:

$$V+E=C$$

Tables can also be done with LaTeX:

$$\begin{array}{ccccccc}& AC& BN& D& F& K& W\\ AC& 0& 91& 80& 259& 70& 121\\ BN& 91& 0& 77& 175& 27& 84\\ D& 80& 77& 0& 232& 47& 29\\ F& 259& 175& 232& 0& 189& 236\\ K& 70& 27& 47& 189& 0& 55\\ W& 121& 84& 29& 236& 55& 0\end{array}$$

References

1. [1]
   R. K. Ahuja, J. B. Orlin, and D. Sharma, “Very large-scale neighborhood search,” International Transactions in Operational Research, vol. 7, no. 4, pp. 301–317, 2000, doi: 10.1016/S0969-6016(00)00009-5. ↩
2. [2]

   “Berge’s theorem,” Wikipedia. [Online]. Available: https://en.wikipedia.org/wiki/Berge’s_theorem. [Accessed: Jun. 18, 2026]. ↩