Facets of the linear ordering polytope
From MaRDI portal
Recommendations
- New Facets of the Linear Ordering Polytope
- 0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets
- More facets from fences for linear ordering and acyclic subgraph polytopes
- scientific article; zbMATH DE number 1263289
- On the integral dicycle packings and covers and the linear ordering polytope
Cites work
- A Cutting Plane Algorithm for the Linear Ordering Problem
- scientific article; zbMATH DE number 3659595 (Why is no real title available?)
- scientific article; zbMATH DE number 3476924 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- On the acyclic subgraph polytope
- Permutation Polyhedra
- Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems
Cited in
(97)- A new formulation for the traveling deliveryman problem
- Weighted graphs defining facets: A connection between stable set and linear ordering polytopes
- Cycle-based facets of chromatic scheduling polytopes
- Analysis of multinomial models under inequality constraints: applications to measurement theory
- Vertical order in the Hilbert cube
- An inexact algorithm for the sequential ordering problem
- Generalizing the concept of binary choice systems induced by rankings: One way of probabilizing deterministic measurement structures
- Induced binary probabilities and the linear ordering polytope: A status report
- Geometric and combinatorial properties of the polytope of binary choice probabilities
- Valid inequalities and facets of the capacitated plant location problem
- More facets from fences for linear ordering and acyclic subgraph polytopes
- A branch-and-cut algorithm for vehicle routing problems
- An approval-voting polytope for linear orders
- Probabilistic biclassification and random variable representations
- General transitivity conditions for fuzzy reciprocal preference matrices.
- Facets of linear signed order polytopes.
- Weak order polytopes.
- Signed orders, choice probabilities, and linear polytopes
- Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
- An integer programming approach to optimal basic block instruction scheduling for single-issue processors
- An analog of the Cook theorem for polytopes
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- Combinatorial optimization and small polytopes
- Doubly stochastic matrices and dicycle covers and packings in Eulerian digraphs
- Facets and algorithms for capacitated lot sizing
- Workload balancing and loop layout in the design of a flexible manufacturing system
- A combinatorial study of partial order polytopes
- Independent random utility representations
- On the integral dicycle packings and covers and the linear ordering polytope
- On the partial order polytope of a digraph
- Commutative algebra of statistical ranking
- Optimal solutions for the double row layout problem
- Structural aspects of ordered polymatroids
- Analysis of a generalized linear ordering problem via integer programming
- Facets of the dynamic monopoly polytope: linear ordering formulation
- On the linear ordering problem and the rankability of data
- Computing in combinatorial optimization
- An integer programming approach for the search of discretization orders in distance geometry problems
- An exact algorithm for the edge coloring by total labeling problem
- Facets from gadgets
- A branch-and-cut algorithm for the target visitation problem
- New exact approaches to row layout problems
- \textsc{QTest} 2.1: quantitative testing of theories of binary choice using Bayesian inference
- A note on small linear-ordering polytopes
- Facets of the polytope of legal sequences
- A branch-and-bound algorithm for the linear ordering problem with cumulative costs
- Fence facets from non-regular graphs for the linear ordering polytope
- The linear ordering problem with cumulative costs
- Multiprocessor scheduling under precedence constraints: polyhedral results
- On the exact solution of a facility layout problem
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
- On the combinatorial structure of chromatic scheduling polytopes
- How to recycle your facets
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Facets of the weak order polytope derived from the induced partition projection
- Computational approaches to MAX-cut
- Global approaches for facility layout and VLSI floorplanning
- A set covering approach for the double traveling salesman problem with multiple stacks
- Spectra of symmetrized shuffling operators
- Crossing Minimization in Storyline Visualization
- Facet generating techniques
- A branch-and-cut algorithm for a resource-constrained scheduling problem
- Acyclic orientations with path constraints
- Levelness of Order Polytopes
- The corridor allocation problem
- The examples of non-integer vertices of the relaxation polytope of the linear ordering problem and their structure
- scientific article; zbMATH DE number 3902051 (Why is no real title available?)
- scientific article; zbMATH DE number 3908501 (Why is no real title available?)
- On the acyclic subgraph polytope
- Polyhedral Combinatorics in Combinatorial Optimization
- A minimum violations ranking method
- Revised GRASP with path-relinking for the linear ordering problem
- A lexicographic semiorder polytope and probabilistic representations of choice
- The strongest facets of the acyclic subgraph polytope are unknown
- New Facets of the Linear Ordering Polytope
- The rankability of data
- The interval order polytope of a digraph
- The linear extension polytope of a poset
- Order-chain polytopes
- Rank aggregation in cyclic sequences
- 0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets
- Median linear orders: Heuristics and a branch and bound algorithm
- Diffuse scattering on graphs
- Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures
- A linear ordering problem with weighted rank
- Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem
- A mixed-integer programming formulation for optimizing the double row layout problem
- Revisiting ILP models for exact crossing minimization in storyline drawings
- The PACE 2024 parameterized algorithms and computational experiments challenge: one-sided crossing minimization
- PACE solver description: exact solution of the one-sided crossing minimization problem by the MPPEG team
- A polyhedral study of a relaxation of the routing and spectrum allocation problem
- Primary facets of order polytopes
- A unified modelling framework and improved formulations for single-hoist cyclic scheduling
- Recent trends in combinatorial optimization
- Applying mod-\(k\)-cuts for solving linear ordering problems
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
This page was built for publication: Facets of the linear ordering polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3698819)
