The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm (Q1590800): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4861868 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3792511 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3795496 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Orienteering Problem with Time Windows / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Optimal Algorithm for the Orienteering Tour Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Using artificial neural networks to solve the orienteering problem / rank | |||
Normal rank | |||
Latest revision as of 12:07, 3 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm |
scientific article |
Statements
The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm (English)
0 references
3 September 2002
0 references
bus touring problem
0 references
integer linear-programming model
0 references
