On the partial order polytope of a digraph
type: Item
instance of: scholarly article
title: On the partial order polytope of a digraph
zbMATH Open document ID: 0848.90105
DOI: 10.1007/BF02592097
author: Rudolf Müller
published in: Mathematical Programming. Series A. Series B
publication date: 1996-10-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 52B12
zbMATH DE Number: 894755
zbMATH Keywords: polyhedral combinatorics
zbMATH Keywords: partial order polytope
zbMATH Keywords: digraph
zbMATH Keywords: transitive acyclic arc sets
zbMATH Keywords: polynomial separation algorithm
zbMATH Keywords: valid inequalities
zbMATH Keywords: clique partitioning polytope
zbMATH Keywords: maximum weighted acyclic subdigraph problem
zbMATH Keywords: maximum weighted linear ordering problem
zbMATH Keywords: flexible manufacturing problem
describes a project that uses: LOLIB
MaRDI profile type: Publication
cites work: Q3056948
cites work: On the cut polytope
cites work: Q3097395
cites work: \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
cites work: The partition problem
cites work: Edmonds polytopes and a hierarchy of combinatorial problems
cites work: Clique-Web Facets for Multicut Polytopes
cites work: Binary Probabilities Induced by Rankings
cites work: Induced binary probabilities and the linear ordering polytope: A status report
cites work: Q4198056
cites work: On the acyclic subgraph polytope
cites work: Facets of the linear ordering polytope
cites work: Geometric algorithms and combinatorial optimization
cites work: A cutting plane algorithm for a clustering problem
cites work: Facets of the clique partitioning polytope
cites work: Q3221421
cites work: More facets from fences for linear ordering and acyclic subgraph polytopes
cites work: Q4859913
cites work: Q4234162
cites work: Q3680289
cites work: A note on small linear-ordering polytopes
cites work: Q3818127
description: scientific article; zbMATH DE number 894755