Pages that link to "Item:Q665991"
From MaRDI portal
The following pages link to The Wiener maximum quadratic assignment problem (Q665991):
Displayed 12 items.
- Eccentricity sums in trees (Q290112) (← links)
- On the maximal Wiener index and related questions (Q427906) (← links)
- The minimal number of subtrees of a tree (Q489363) (← links)
- The minimal number of subtrees with a given degree sequence (Q489367) (← links)
- The distances between internal vertices and leaves of a tree (Q740265) (← links)
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems (Q1662098) (← links)
- Special cases of the quadratic shortest path problem (Q1743483) (← links)
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices (Q1754256) (← links)
- Another well-solvable case of the QAP: maximizing the job completion time variance (Q1758277) (← links)
- Linear programming insights into solvable cases of the quadratic assignment problem (Q2339831) (← links)
- Well-solvable cases of the QAP with block-structured matrices (Q2345597) (← links)
- A New Tractable Case of the QAP with a Robinson Matrix (Q5743542) (← links)