Pages that link to "Item:Q3698819"
From MaRDI portal
The following pages link to Facets of the linear ordering polytope (Q3698819):
Displayed 50 items.
- 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)
- Median linear orders: Heuristics and a branch and bound algorithm (Q582183) (← 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)
- 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)
- A branch-and-bound algorithm for the linear ordering problem with cumulative costs (Q2426525) (← links)
- Fence facets from non-regular graphs for the linear ordering polytope (Q2448162) (← links)
- The linear ordering problem with cumulative costs (Q2482806) (← links)
- Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902) (← links)
- On the exact solution of a facility layout problem (Q2496073) (← links)
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs (Q2497757) (← links)
- On the combinatorial structure of chromatic scheduling polytopes (Q2500535) (← links)
- How to recycle your facets (Q2506820) (← links)
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions (Q2568330) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Computational Approaches to Max-Cut (Q2802547) (← links)
- Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
- Spectra of Symmetrized Shuffling Operators (Q2925678) (← links)
- A branch-and-cut algorithm for a resource-constrained scheduling problem (Q3004200) (← links)
- Acyclic Orientations with Path Constraints (Q3163668) (← links)
- On the acyclic subgraph polytope (Q3698818) (← links)
- Polyhedral Combinatorics in Combinatorial Optimization (Q3763906) (← links)