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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Operations Research Forum Jg. 2; H. 4; S. 48
Hauptverfasser: Dong, Yuanyuan, Goldberg, Andrew V., Noe, Alexander, Parotsidis, Nikos, Resende, Mauricio G. C., Spaen, Quico
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Cham Springer International Publishing 01.12.2021
Springer Nature B.V
Schlagworte:
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-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie: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