# New instances for maximum weight independent set from a vehicle routing application

arXiv: https://arxiv.org/abs/2105.12623 · HTML: https://mlsanity.com/paper/2105.12623/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 26 May 2021.

## Built on by (most cited first, 4 of 4)

- [What's Wrong with Deep Learning in Tree Search for Combinatorial Optimization](https://mlsanity.com/paper/2201.10494/) (2022)
- [Unveiling the Limits of Learned Local Search Heuristics: Are You the Mightiest of the Meek?](https://mlsanity.com/paper/2310.19990/) (2023)
- [A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems](https://mlsanity.com/paper/2203.15805/) (2022)
- [Dynamic Location Search for Identifying Maximum Weighted Independent Sets in Complex Networks](https://mlsanity.com/paper/2505.04674/) (2025)

## Abstract (arXiv)

We present a set of new instances of the maximum weight independent set problem. These instances are derived from a real-world vehicle routing problem and are challenging to solve in part because of their large size. We present instances with up to 881 thousand nodes and 383 million edges.