Pages that link to "Item:Q411238"
From MaRDI portal
The following pages link to Polynomially solvable special cases of the quadratic bottleneck assignment problem (Q411238):
Displayed 8 items.
- A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints (Q1742190) (← links)
- Minimum status of series-reduced trees with given parameters (Q2160321) (← links)
- Which numbers are status differences? (Q2242632) (← links)
- Status connectivity indices of line graphs (Q2665473) (← links)
- Minimum status of trees with a given degree sequence (Q2687032) (← links)
- (Q4642470) (redirect page) (← links)
- (Q5866983) (← links)
- Proximity, remoteness and maximum degree in graphs (Q6045455) (← links)