The following pages link to (Q3680606):
Displaying 17 items.
- The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Induced binary probabilities and the linear ordering polytope: A status report (Q1184362) (← links)
- Generalized transitive tournaments and doubly stochastic matrices (Q1194517) (← links)
- Vertices of the generalized transitive tournament polytope (Q1356548) (← links)
- *-graphs of vertices of the generalized transitive tournament polytope (Q1377707) (← links)
- Weak order polytopes. (Q1420590) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
- Doubly stochastic matrices and dicycle covers and packings in Eulerian digraphs (Q1816947) (← links)
- \((0,{1\over 2},1)\) matrices which are extreme points of the generalized transitive tournament polytope (Q1893082) (← links)
- On the integral dicycle packings and covers and the linear ordering polytope (Q1894372) (← links)
- On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope (Q1906776) (← links)
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments (Q2433800) (← links)
- Generating facets for the cut polytope of a graph by triangular elimination (Q2465651) (← links)
- Transitive packing (Q4645940) (← links)
- An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
- Determining the automorphism group of the linear ordering polytope (Q5946819) (← links)
