k-interchange procedures for local search in a precedence-constrained routing problem (Q1836590): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(83)90099-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2117235989 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Local Search for the Asymmetric Traveling Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some Examples of Difficult Traveling Salesman Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Asymptotic, Probabilistic Analysis of a Routing Problem / rank | |||
Normal rank | |||
Latest revision as of 17:06, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | k-interchange procedures for local search in a precedence-constrained routing problem |
scientific article |
Statements
k-interchange procedures for local search in a precedence-constrained routing problem (English)
0 references
1983
0 references
k-interchange procedures
0 references
local search
0 references
precedence-constrained routing problem
0 references
single vehicle many-to-many Dial-A-Ride problem
0 references
breadth-first
0 references
depth-first
0 references
heuristic algorithms
0 references
