Online traveling salesman problem with deadlines and service flexibility (Q498429): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6485827 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
online algorithms | |||
| Property / zbMATH Keywords: online algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
traveling salesman problem | |||
| Property / zbMATH Keywords: traveling salesman problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
deadlines | |||
| Property / zbMATH Keywords: deadlines / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
service flexibility | |||
| Property / zbMATH Keywords: service flexibility / rank | |||
Normal rank | |||
Revision as of 23:39, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Online traveling salesman problem with deadlines and service flexibility |
scientific article |
Statements
Online traveling salesman problem with deadlines and service flexibility (English)
0 references
28 September 2015
0 references
online algorithms
0 references
traveling salesman problem
0 references
deadlines
0 references
service flexibility
0 references
