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 ()
Additional contact information
Andrew V. Goldberg: Amazon.com
Alexander Noe: University of Vienna
Nikos Parotsidis: University of Copenhagen
Mauricio G. C. Resende: University of Washington
Quico Spaen: Amazon.com

SN Operations Research Forum, 2021, vol. 2, issue 4, 1-6

Abstract: 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.

Keywords: Maximum weight independent set; Problem instances; Experimental algorithms (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s43069-021-00084-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:snopef:v:2:y:2021:i:4:d:10.1007_s43069-021-00084-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/43069

DOI: 10.1007/s43069-021-00084-x

Access Statistics for this article

SN Operations Research Forum is currently edited by Marco Lübbecke

More articles in SN Operations Research Forum from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().