scientific article; zbMATH DE number 3902393
From MaRDI portal
Publication:3680606
Recommendations
Cited in
(23)- Induced binary probabilities and the linear ordering polytope: A status report
- Generalized transitive tournaments and doubly stochastic matrices
- Vertices of the generalized transitive tournament polytope
- *-graphs of vertices of the generalized transitive tournament polytope
- Weak order polytopes.
- On approximability of linear ordering and related NP-optimization problems on graphs.
- Doubly stochastic matrices and dicycle covers and packings in Eulerian digraphs
- \((0,{1\over 2},1)\) matrices which are extreme points of the generalized transitive tournament polytope
- On the integral dicycle packings and covers and the linear ordering polytope
- On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope
- On the partial order polytope of a digraph
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
- Generating facets for the cut polytope of a graph by triangular elimination
- A Cutting Plane Algorithm for the Linear Ordering Problem
- scientific article; zbMATH DE number 3888925 (Why is no real title available?)
- scientific article; zbMATH DE number 3902051 (Why is no real title available?)
- On the acyclic subgraph polytope
- scientific article; zbMATH DE number 1263289 (Why is no real title available?)
- Transitive packing
- The feedback arc set problem with triangle inequality is a vertex cover problem
- An exact method for the minimum feedback arc set problem
- Determining the automorphism group of the linear ordering polytope
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680606)
