Pages that link to "Item:Q2497757"
From MaRDI portal
The following pages link to Facets of the linear ordering polytope: a unification for the fence family through weighted graphs (Q2497757):
Displaying 12 items.
- 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)
- Weighted graphs defining facets: A connection between stable set and linear ordering polytopes (Q1013288) (← links)
- Ranking hypotheses to minimize the search cost in probabilistic inference models (Q1025988) (← links)
- Testing probabilistic models of choice using column generation (Q1652625) (← links)
- Extended formulations for order polytopes through network flows (Q1736010) (← links)
- A correct response model in knowledge structure theory (Q2244625) (← links)
- \textsc{QTest} 2.1: quantitative testing of theories of binary choice using Bayesian inference (Q2332851) (← links)
- Bayesian inference and model comparison for random choice structures (Q2343780) (← links)
- How to recycle your facets (Q2506820) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- On a weighted generalization of α-critical graphs (Q3439372) (← links)
