An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem (Q6142940): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Matheuristic algorithms for the parallel drone scheduling traveling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The parallel drone scheduling problem with multiple drones and vehicles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimization and maximization versions of the quadratic travelling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Facet identification for the symmetric traveling salesman polytope / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:56, 23 August 2024
scientific article; zbMATH DE number 7793380
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem |
scientific article; zbMATH DE number 7793380 |
Statements
An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem (English)
0 references
23 January 2024
0 references
parallel drone scheduling
0 references
traveling salesman problem
0 references
branch-and-cut
0 references
benchmark instances
0 references
