New instances for maximum weight independent set from a vehicle routing application
Yuanyuan Dong, Andrew V. Goldberg, Alexander Noe, Nikos Parotsidis,, Mauricio G. C. Resende, and Quico Spaen
TL;DR
This paper introduces a new set of large, real-world inspired instances for the maximum weight independent set problem, highlighting their complexity and scale derived from vehicle routing applications.
Contribution
The paper provides a collection of large, challenging instances for the maximum weight independent set problem based on real-world vehicle routing data.
Findings
Instances have up to 881,000 nodes and 383 million edges.
These instances are notably difficult to solve due to their size.
They offer a new benchmark for testing algorithms.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsVehicle Routing Optimization Methods · Web Applications and Data Management · Data Management and Algorithms