Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2105.12623 v2 pith:OIOQMEM6 submitted 2021-05-26 cs.DS math.OC

Yuanyuan Dong , Andrew V. Goldberg , Alexander Noe , Nikos Parotsidis , Mauricio G. C. Resende , Quico Spaen This is my paper · ORCID
classification cs.DSmath.OC
keywords instancesindependentmaximumproblemroutingvehicleweightapplication
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools