Publication:3221421

zbMath0557.68045MaRDI QIDQ3221421

Michael Jünger

Publication date: 1985

zbMATH Keywords

linear programming; polynomial-time algorithm; polyhedral combinatorics; acyclic subdigraph polytope; acyclic subdigraph problem; weakly acyclic digraphs

Mathematics Subject Classification ID

05-02: Research exposition (monographs, survey articles) pertaining to combinatorics

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

68R10: Graph theory (including graph drawing) in computer science

51M20: Polyhedra and polytopes; regular figures, division of spaces

90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming

68-02: Research exposition (monographs, survey articles) pertaining to computer science

05C20: Directed graphs (digraphs), tournaments

Related Items

Ear decomposition for pair comparison data, Integral infeasibility and testing total dual integrality, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Measuring intransitivity, A cutting-plane approach to the edge-weighted maximal clique problem, Approximations for the maximum acyclic subgraph problem, New results on the computation of median orders, The reversing number of a digraph, 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, Solving real-world linear ordering problems using a primal-dual interior point cutting plane method, NP-hardness results for the aggregation of linear orders into median orders, A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments, How to recycle your facets, A survey on the linear ordering problem for weighted or unweighted tournaments