<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>algorithms on void?</title>
    <link>https://netotz.github.io/tags/algorithms/</link>
    <description>Recent content in algorithms on void?</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en</language>
    <lastBuildDate>Tue, 30 Aug 2022 00:00:00 +0000</lastBuildDate><atom:link href="https://netotz.github.io/tags/algorithms/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>A simple application of refactorization</title>
      <link>https://netotz.github.io/posts/refactor-cp/</link>
      <pubDate>Tue, 30 Aug 2022 00:00:00 +0000</pubDate>
      
      <guid>https://netotz.github.io/posts/refactor-cp/</guid>
      <description>Valuable code is such because it works. It truly doesn&amp;rsquo;t matter how such code looks or under what standards or rules it was written. If it doesn&amp;rsquo;t work, it&amp;rsquo;s trash. If it works, it adds value.
This is something that almost all programmers know. We should get this taught early in our journeys because we ought to solve problems by writing code. The satisfaction that a developer gets when she sees her program working as expected and how it actually solves a real problem is unexplainable (she can finally go to sleep).</description>
    </item>
    
    <item>
      <title>The process of designing a new algorithm</title>
      <link>https://netotz.github.io/posts/a-fvs/</link>
      <pubDate>Tue, 26 Jul 2022 00:00:00 +0000</pubDate>
      
      <guid>https://netotz.github.io/posts/a-fvs/</guid>
      <description>Introduction Earlier in the year I wrote about how the objective function of an optimization problem is decomposed and partially evaluated so an algorithm that uses that function runs faster. I found this technique so interesting that I tried to explain it in that post. But the goal wasn&amp;rsquo;t to just understand the decomposing of an objective function. I needed to design a fast algorithm to solve the $\alpha$-neighbor $p$-center problem (ANPCP), as I mentioned in the other post, and while researching to do so, I came across the concept of the fast interchange or fast swap and how it was applied to other location problems (not the ANPCP).</description>
    </item>
    
    <item>
      <title>Decomposing an objective function</title>
      <link>https://netotz.github.io/posts/decomposing-of/</link>
      <pubDate>Tue, 22 Feb 2022 00:00:00 +0000</pubDate>
      
      <guid>https://netotz.github.io/posts/decomposing-of/</guid>
      <description>As the thesis for the BSc Software Engineering, I&amp;rsquo;m researching heuristic algorithms in the Operations Research field. Specifically, my mentor and I are implementing heuristics for the $\alpha$-neighbor $p$-center problem (ANPCP for short). Because the literature about it is scarce, we&amp;rsquo;ve been reading papers that use heuristic algorithms for similar problems, and trying to adapt them to the ANPCP. In this process, I found it interesting how some authors decompose the objective function of a problem and evaluate it step by step while, at the same time, applying a heuristic to the current solution.</description>
    </item>
    
  </channel>
</rss>
