Pages that link to "Item:Q3978586"
From MaRDI portal
The following pages link to Some relations between neighbourhood graphs for a permutation problem (Q3978586):
Displaying 5 items.
- On the heuristic solution of the permutation flow shop problem by path algorithms (Q690012) (← links)
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947) (← links)
- Neighborhoods in problems of discrete mathematics (Q1907788) (← links)
- On the theoretical properties of swap multimoves (Q2643800) (← links)
- The 2-neighbourhood covering problem on permutation graphs (Q2793037) (← links)