Pages that link to "Item:Q1915807"
From MaRDI portal
The following pages link to On the partial order polytope of a digraph (Q1915807):
Displaying 20 items.
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
- The numbers of edges of the order polytope and the chain polytope of a finite partially ordered set (Q512575) (← links)
- Exact algorithms for cluster editing: Evaluation and experiments (Q534775) (← links)
- Primary facets of order polytopes (Q730181) (← links)
- Optimal facility layout design (Q1306388) (← links)
- More facets from fences for linear ordering and acyclic subgraph polytopes (Q1326756) (← links)
- Arc-based integer programming formulations for three variants of proportional symbol maps (Q1751132) (← links)
- A combinatorial study of partial order polytopes (Q1867280) (← links)
- On the integral dicycle packings and covers and the linear ordering polytope (Q1894372) (← links)
- Facets from gadgets (Q2220662) (← links)
- Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- Polyhedral aspects of partial orders and comparability graphs (Q2741302) (← links)
- Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation (Q2962548) (← links)
- The niche graphs of doubly partial orders (Q3582500) (← links)
- (Q3972518) (← links)
- The clique partitioning problem: Facets and patching facets (Q4537609) (← links)
- The path set polytope of an acyclic, directed graph with an application to machine sequencing (Q4733692) (← links)
- A Note on the Order of Iterated Line Digraphs (Q5272924) (← links)
- Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures (Q6084673) (← links)
