The following pages link to (Q4537753):
Displaying 10 items.
- A minimum violations ranking method (Q400018) (← links)
- Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- A semidefinite optimization approach to the target visitation problem (Q895779) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks (Q2266938) (← links)
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs (Q2497757) (← links)
- The Rankability of Data (Q5025777) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313022) (← links)
- A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation (Q5868914) (← links)