scientific article

zbMath0557.68045MaRDI QIDQ3221421

Michael Jünger

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear programmingpolynomial-time algorithmpolyhedral combinatoricsacyclic subdigraph polytopeacyclic subdigraph problemweakly acyclic digraphs

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph theory (including graph drawing) in computer science (68R10) Polyhedra and polytopes; regular figures, division of spaces (51M20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Directed graphs (digraphs), tournaments (05C20)

Related Items (23)

Approximations for the maximum acyclic subgraph problem ⋮ The reversing number of a digraph ⋮ On the integral dicycle packings and covers and the linear ordering polytope ⋮ New results on the computation of median orders ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ 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 ⋮ Revised GRASP with path-relinking for the linear ordering problem ⋮ A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments ⋮ Voting Procedures, Complexity of ⋮ The strongest facets of the acyclic subgraph polytope are unknown ⋮ Transitive packing ⋮ A polyhedral approach to the feedback vertex set problem ⋮ Ear decomposition for pair comparison data ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ NP-hardness results for the aggregation of linear orders into median orders ⋮ How to recycle your facets ⋮ Ranking tournaments with no errors. I: Structural description ⋮ Integral infeasibility and testing total dual integrality ⋮ Measuring intransitivity ⋮ On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: constraint programming vs. mixed integer programming ⋮ A cutting-plane approach to the edge-weighted maximal clique problem

This page was built for publication: