Pages that link to "Item:Q4699161"
From MaRDI portal
The following pages link to New Facets of the Linear Ordering Polytope (Q4699161):
Displaying 25 items.
- A family of efficient six-regular circulants representable as a Kronecker product (Q260026) (← links)
- Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
- Applying mod-\(k\)-cuts for solving linear ordering problems (Q839896) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Analysis of multinomial models under inequality constraints: applications to measurement theory (Q1042296) (← links)
- More facets from fences for linear ordering and acyclic subgraph polytopes (Q1326756) (← links)
- An approval-voting polytope for linear orders (Q1368384) (← links)
- Probabilistic biclassification and random variable representations (Q1368395) (← links)
- Facets of linear signed order polytopes. (Q1414239) (← links)
- Weak order polytopes. (Q1420590) (← links)
- The biorder polytope (Q1765958) (← links)
- Workload balancing and loop layout in the design of a flexible manufacturing system (Q1840856) (← links)
- A combinatorial study of partial order polytopes (Q1867280) (← links)
- Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron (Q1877595) (← links)
- \textsc{QTest} 2.1: quantitative testing of theories of binary choice using Bayesian inference (Q2332851) (← links)
- Fence facets from non-regular graphs for the linear ordering polytope (Q2448162) (← links)
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs (Q2497757) (← links)
- How to recycle your facets (Q2506820) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- The Polytope of<i>m</i>-Subspaces of a Finite Affine Space (Q3004206) (← links)
- Levelness of Order Polytopes (Q3300753) (← links)
- (Q4637014) (← links)
- DECOMPOSITION AND PARALLELIZATION TECHNIQUES FOR ENUMERATING THE FACETS OF COMBINATORIAL POLYTOPES (Q4682163) (← links)
- Determining the automorphism group of the linear ordering polytope (Q5946819) (← links)
- Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures (Q6084673) (← links)