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.

Uloženo v:

Podrobná bibliografie
Vydáno v:	Operations Research Forum Ročník 2; číslo 4; s. 48
Hlavní autoři:	Dong, Yuanyuan, Goldberg, Andrew V., Noe, Alexander, Parotsidis, Nikos, Resende, Mauricio G. C., Spaen, Quico
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Cham Springer International Publishing 01.12.2021 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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.
Bibliografie:	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