# Algorithmic Innovation

**URL:** https://forum.tig.foundation/c/algorithmic-innovation/6.md

[Latest](https://forum.tig.foundation/latest.md) · [Categories](https://forum.tig.foundation/categories.md) · [Tags](https://forum.tig.foundation/tags.md)

---

## [About the Algorithmic Innovation category](https://forum.tig.foundation/t/about-the-algorithmic-innovation-category/32)

<div class="topic-metadata">

**Author:** [@TheDoctor](https://forum.tig.foundation/u/TheDoctor)\
**Replies:** 0

</div>

---

## [Advance Submission: Vehicle Routing](https://forum.tig.foundation/t/advance-submission-vehicle-routing/87)

<div class="topic-metadata">

**Author:** [@Aoibheann](https://forum.tig.foundation/u/Aoibheann)\
**Replies:** 3\
**Last updated:** [June 30, 2026, 9:47am UTC](https://forum.tig.foundation/t/advance-submission-vehicle-routing/87 "2026-06-30T09:47:52Z")

</div>

Advance Rewards Submission We are thrilled to announce that our second Advance submission for the Vehicle Routing Challenge has been made public today (round 121)! The algorithm, HGS\_advance, is now open for the communi…

---

## [Advance Submission: Neural Net Optimizer](https://forum.tig.foundation/t/advance-submission-neural-net-optimizer/84)

<div class="topic-metadata">

**Author:** [@Aoibheann](https://forum.tig.foundation/u/Aoibheann)\
**Replies:** 1\
**Last updated:** [April 11, 2026, 9:21am UTC](https://forum.tig.foundation/t/advance-submission-neural-net-optimizer/84 "2026-04-11T09:21:07Z")

</div>

Advance Rewards Submission We are delighted to share that our first Advance submission for our Neural Net Optimizer Challenge has been made public today (round 111)! The algorithm, Nova Prime FGD, is now open for the co…

---

## [Advance Submission: Vector Search](https://forum.tig.foundation/t/advance-submission-vector-search/67)

<div class="topic-metadata">

**Author:** [@Aoibheann](https://forum.tig.foundation/u/Aoibheann)\
**Replies:** 4\
**Last updated:** [September 19, 2025, 1:59am UTC](https://forum.tig.foundation/t/advance-submission-vector-search/67 "2025-09-19T01:59:04Z")

</div>

Advance Rewards Submission We are delighted to share that our first Advance submission for Vector Search has been made public today! The algorithm, created by a research team at Granite Labs LLC, is now open for the com…

---

## [\[SOTA Comparison\] Knapsack](https://forum.tig.foundation/t/sota-comparison-knapsack/64)

<div class="topic-metadata">

**Author:** [@Aoibheann](https://forum.tig.foundation/u/Aoibheann)\
**Replies:** 0\
**Last updated:** [August 15, 2025, 12:33pm UTC](https://forum.tig.foundation/t/sota-comparison-knapsack/64 "2025-08-15T12:33:49Z")

</div>

Our Knapsack Challenge Evaluator provides a streamlined framework for benchmarking TIG Knapsack algorithms against state-of-the-art (SOTA) methods on key academic datasets. The goal of this thread is to encourage commun…

---

## [\[SOTA Comparison\] Vehicle Routing](https://forum.tig.foundation/t/sota-comparison-vehicle-routing/65)

<div class="topic-metadata">

**Author:** [@Aoibheann](https://forum.tig.foundation/u/Aoibheann)\
**Replies:** 0\
**Last updated:** [August 15, 2025, 12:33pm UTC](https://forum.tig.foundation/t/sota-comparison-vehicle-routing/65 "2025-08-15T12:33:44Z")

</div>

Our Vehicle Routing Challenge Evaluator provides a streamlined framework for benchmarking TIG Vehicle Routing algorithms against state-of-the-art (SOTA) methods on key academic datasets. The goal of this thread is to en…

---

## [Breakthrough Submission: Vehicle Routing](https://forum.tig.foundation/t/breakthrough-submission-vehicle-routing/33)

<div class="topic-metadata">

**Author:** [@TheDoctor](https://forum.tig.foundation/u/TheDoctor)\
**Replies:** 7\
**Last updated:** [January 20, 2025, 7:23pm UTC](https://forum.tig.foundation/t/breakthrough-submission-vehicle-routing/33 "2025-01-20T19:23:51Z")

</div>

As some of you may have noticed, our first Breakthrough Rewards submission was made public today for Vehicle Routing. Please see here: Breakthrough Evidence There are two code submissions that embody the method describ…
