Pages that link to "Item:Q3698819"
From MaRDI portal
The following pages link to Facets of the linear ordering polytope (Q3698819):
Displaying 50 items.
- The corridor allocation problem (Q339697) (← links)
- A minimum violations ranking method (Q400018) (← links)
- Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
- A lexicographic semiorder polytope and probabilistic representations of choice (Q440019) (← links)
- The linear extension polytope of a poset (Q510939) (← links)
- Rank aggregation in cyclic sequences (Q523159) (← links)
- Median linear orders: Heuristics and a branch and bound algorithm (Q582183) (← links)
- Primary facets of order polytopes (Q730181) (← links)
- Recent trends in combinatorial optimization (Q788638) (← 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)
- A new formulation for the traveling deliveryman problem (Q1003469) (← links)
- Weighted graphs defining facets: A connection between stable set and linear ordering polytopes (Q1013288) (← links)
- Cycle-based facets of chromatic scheduling polytopes (Q1013295) (← links)
- Analysis of multinomial models under inequality constraints: applications to measurement theory (Q1042296) (← links)
- An inexact algorithm for the sequential ordering problem (Q1108187) (← links)
- Generalizing the concept of binary choice systems induced by rankings: One way of probabilizing deterministic measurement structures (Q1184360) (← links)
- Induced binary probabilities and the linear ordering polytope: A status report (Q1184362) (← links)
- Geometric and combinatorial properties of the polytope of binary choice probabilities (Q1184363) (← links)
- Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
- More facets from fences for linear ordering and acyclic subgraph polytopes (Q1326756) (← links)
- A branch-and-cut algorithm for vehicle routing problems (Q1339118) (← 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)
- Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks (Q1751162) (← links)
- An integer programming approach to optimal basic block instruction scheduling for single-issue processors (Q1751173) (← links)
- An analog of the Cook theorem for polytopes (Q1759309) (← links)
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts (Q1814791) (← links)
- Combinatorial optimization and small polytopes (Q1814809) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← 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)
- Independent random utility representations (Q1867819) (← links)
- On the partial order polytope of a digraph (Q1915807) (← links)
- Commutative algebra of statistical ranking (Q1931695) (← links)
- Optimal solutions for the double row layout problem (Q1940444) (← links)
- Analysis of a generalized linear ordering problem via integer programming (Q2009010) (← links)
- Facets of the dynamic monopoly polytope: linear ordering formulation (Q2042076) (← links)
- On the linear ordering problem and the rankability of data (Q2072628) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- An integer programming approach for the search of discretization orders in distance geometry problems (Q2174886) (← links)
- An exact algorithm for the edge coloring by total labeling problem (Q2178329) (← links)
- Facets from gadgets (Q2220662) (← links)
- A branch-and-cut algorithm for the target visitation problem (Q2294072) (← links)
- New exact approaches to row layout problems (Q2295979) (← links)
- \textsc{QTest} 2.1: quantitative testing of theories of binary choice using Bayesian inference (Q2332851) (← links)
- A branch-and-bound algorithm for the linear ordering problem with cumulative costs (Q2426525) (← links)
