New Instances for Maximum Weight Independent Set From a Vehicle Routing Application

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.

Saved in:

Bibliographic Details
Published in:	Operations Research Forum Vol. 2; no. 4; p. 48
Main Authors:	Dong, Yuanyuan, Goldberg, Andrew V., Noe, Alexander, Parotsidis, Nikos, Resende, Mauricio G. C., Spaen, Quico
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.12.2021 Springer Nature B.V
Subjects:	Algorithms Applications of Mathematics Business and Management Conflicts of interest Heuristic Linear programming Math Applications in Computer Science Mathematical and Computational Engineering Operations Research/Decision Theory Optimization Short Communication Vehicle routing Florida United States > US Maximum weight independent set Problem instances Experimental algorithms
ISSN:	2662-2556, 2662-2556
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
Bibliography:	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ISSN:	2662-2556 2662-2556
DOI:	10.1007/s43069-021-00084-x