New instances for maximum weight independent set from a vehicle routing application
Reviewed by Pithpith:OIOQMEM6open to challenge →
classification
cs.DS
math.OC
keywords
instancesindependentmaximumproblemroutingvehicleweightapplication
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.