The following pages link to (Q3221421):
Displaying 25 items.
- Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
- Polyhedral study of the connected subgraph problem (Q468440) (← links)
- Ear decomposition for pair comparison data (Q696936) (← links)
- Integral infeasibility and testing total dual integrality (Q757248) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Measuring intransitivity (Q1277476) (← links)
- A cutting-plane approach to the edge-weighted maximal clique problem (Q1309944) (← links)
- Approximations for the maximum acyclic subgraph problem (Q1332750) (← links)
- New results on the computation of median orders (Q1356737) (← links)
- The reversing number of a digraph (Q1894351) (← 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)
- On the partial order polytope of a digraph (Q1915807) (← links)
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method (Q1915914) (← links)
- NP-hardness results for the aggregation of linear orders into median orders (Q2271866) (← links)
- Ranking tournaments with no errors. I: Structural description (Q2284746) (← links)
- On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: constraint programming vs. mixed integer programming (Q2337226) (← links)
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments (Q2433800) (← links)
- How to recycle your facets (Q2506820) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- The Complexity of Acyclic Subhypergraph Problems (Q3078379) (← links)
- The strongest facets of the acyclic subgraph polytope are unknown (Q4645939) (← links)
- Transitive packing (Q4645940) (← links)
- A polyhedral approach to the feedback vertex set problem (Q4645941) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
