Pages that link to "Item:Q1326756"
From MaRDI portal
The following pages link to More facets from fences for linear ordering and acyclic subgraph polytopes (Q1326756):
Displaying 29 items.
- Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
- Rank aggregation in cyclic sequences (Q523159) (← 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)
- Weighted graphs defining facets: A connection between stable set and linear ordering polytopes (Q1013288) (← links)
- Two poset polytopes (Q1077721) (← links)
- Probabilistic biclassification and random variable representations (Q1368395) (← links)
- General transitivity conditions for fuzzy reciprocal preference matrices. (Q1398921) (← links)
- Facets of linear signed order polytopes. (Q1414239) (← links)
- Weak order polytopes. (Q1420590) (← links)
- Signed orders, choice probabilities, and linear polytopes (Q1598972) (← links)
- The biorder polytope (Q1765958) (← links)
- Combinatorial optimization and small polytopes (Q1814809) (← links)
- Workload balancing and loop layout in the design of a flexible manufacturing system (Q1840856) (← 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)
- Facets of the dynamic monopoly polytope: linear ordering formulation (Q2042076) (← 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)
- Facet Generating Techniques (Q2971603) (← links)
- A branch and bound algorithm for the minimum storage-time sequencing problem (Q4434517) (← links)
- (Q4537753) (← links)
- (Q4637014) (← links)
- The strongest facets of the acyclic subgraph polytope are unknown (Q4645939) (← links)
- New Facets of the Linear Ordering Polytope (Q4699161) (← links)
- The interval order polytope of a digraph (Q5101405) (← links)
- Determining the automorphism group of the linear ordering polytope (Q5946819) (← links)