Pages that link to "Item:Q1915807"
From MaRDI portal
The following pages link to On the partial order polytope of a digraph (Q1915807):
Displaying 12 items.
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
- Exact algorithms for cluster editing: Evaluation and experiments (Q534775) (← links)
- Primary facets of order polytopes (Q730181) (← links)
- Optimal facility layout design (Q1306388) (← links)
- Arc-based integer programming formulations for three variants of proportional symbol maps (Q1751132) (← links)
- A combinatorial study of partial order polytopes (Q1867280) (← links)
- Facets from gadgets (Q2220662) (← links)
- Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation (Q2962548) (← links)
- The clique partitioning problem: Facets and patching facets (Q4537609) (← links)
- Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures (Q6084673) (← links)
