Pages that link to "Item:Q2494661"

The following pages link to On multi-index assignment polytopes (Q2494661):

Displaying 12 items.

• On the completability of incomplete orthogonal Latin rectangles (Q267209) (← links)
• Facets of the axial three-index assignment polytope (Q908296) (← links)
• The wheels of the OLS polytope: Facets and separation (Q932687) (← links)
• An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors (Q1026115) (← links)
• Clique facets of the axial and planar assignment polytopes (Q1040085) (← links)
• The constant objective value property for multidimensional assignment problems (Q1751146) (← links)
• Finding the dimension of a non-empty orthogonal array polytope (Q2172088) (← links)
• Integer programming models for the multidimensional assignment problem with star costs (Q2256320) (← links)
• Fast separation for the three-index assignment problem (Q2398106) (← links)
• A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem (Q2684046) (← links)
• A characterization of odd-hole inequalities related to Latin squares (Q2868928) (← links)
• The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program (Q5739901) (← links)