New instances for maximum weight independent set from a vehicle routing application
Not on the map. Why?
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.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 26 May 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 1; 2024: 0; 2025: 1.
4 papers.
- 2022What's Wrong with Deep Learning in Tree Search for Combinatorial Optimizationcited by 36
- 2023Unveiling the Limits of Learned Local Search Heuristics: Are You the Mightiest of the Meek?cited by 1
- 2022A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problemscited by 0
- 2025Dynamic Location Search for Identifying Maximum Weighted Independent Sets in Complex Networkscited by 0
- 2025Dynamic Location Search for Identifying Maximum Weighted Independent Sets in Complex Networks7 May 2025
- 2023Unveiling the Limits of Learned Local Search Heuristics: Are You the Mightiest of the Meek?30 Oct 2023
- 2022A Metaheuristic Algorithm for Large Maximum Weight Independent Set Problems28 Mar 2022
- 2022What's Wrong with Deep Learning in Tree Search for Combinatorial Optimization25 Jan 2022