Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme (Q3796954): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57634039, #quickstatements; #temporary_batch_1711504539957 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the Assignment Polytope / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Evaluation of Flow Shop Sequencing Heuristics / 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: Q4739657 / rank | |||
Normal rank | |||
Latest revision as of 17:23, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme |
scientific article |
Statements
Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme (English)
0 references
1988
0 references
Hamiltonian graphs
0 references
local search
0 references
sequencing
0 references
approximation methods
0 references
determination of a suitable neighbourhood
0 references
permutations of m elements
0 references
neighbourhood graphs
0 references
