Pages that link to "Item:Q3698819"

The following pages link to Facets of the linear ordering polytope (Q3698819):

Displaying 29 items.

• Fence facets from non-regular graphs for the linear ordering polytope (Q2448162) (← links)
• The linear ordering problem with cumulative costs (Q2482806) (← links)
• Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902) (← links)
• On the exact solution of a facility layout problem (Q2496073) (← links)
• Facets of the linear ordering polytope: a unification for the fence family through weighted graphs (Q2497757) (← links)
• On the combinatorial structure of chromatic scheduling polytopes (Q2500535) (← links)
• How to recycle your facets (Q2506820) (← links)
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions (Q2568330) (← links)
• A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
• Computational Approaches to Max-Cut (Q2802547) (← links)
• Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
• A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks (Q2835682) (← links)
• Spectra of Symmetrized Shuffling Operators (Q2925678) (← links)
• Crossing Minimization in Storyline Visualization (Q2961530) (← links)
• Facet Generating Techniques (Q2971603) (← links)
• A branch-and-cut algorithm for a resource-constrained scheduling problem (Q3004200) (← links)
• Acyclic Orientations with Path Constraints (Q3163668) (← links)
• Levelness of Order Polytopes (Q3300753) (← links)
• On the acyclic subgraph polytope (Q3698818) (← links)
• Polyhedral Combinatorics in Combinatorial Optimization (Q3763906) (← links)
• The strongest facets of the acyclic subgraph polytope are unknown (Q4645939) (← links)
• The Rankability of Data (Q5025777) (← links)
• The interval order polytope of a digraph (Q5101405) (← links)
• Order-chain polytopes (Q5225041) (← links)
• Diffuse scattering on graphs (Q5965387) (← links)
• Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures (Q6084673) (← links)
• A linear ordering problem with weighted rank (Q6117320) (← links)
• Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem (Q6491337) (← links)
• A mixed-integer programming formulation for optimizing the double row layout problem (Q6661116) (← links)