Pages that link to "Item:Q2433800"
From MaRDI portal
The following pages link to A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments (Q2433800):
Displaying 11 items.
- Tournament scoring problem (Q924403) (← links)
- A tournament of order 14 with disjoint Banks and Slater sets (Q968179) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Models for concurrent product and process design (Q1046061) (← links)
- Determining the results of tournament games using complete graphs generation (Q1715680) (← links)
- Block-insertion-based algorithms for the linear ordering problem (Q2289935) (← links)
- Bounds on the disparity and separation of tournament solutions (Q2348052) (← links)
- The linear ordering problem revisited (Q2629715) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Self-tuning of the noising methods (Q3646090) (← links)
- A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings (Q6066864) (← links)
