Pages that link to "Item:Q1801663"

The following pages link to Linear-time separation algorithms for the three-index assignment polytope (Q1801663):

Displayed 11 items.

• Selected topics on assignment problems (Q697571) ‎ (← links)
• A survey for the quadratic assignment problem (Q852928) ‎ (← links)
• Facets of the axial three-index assignment polytope (Q908296) ‎ (← links)
• Clique facets of the axial and planar assignment polytopes (Q1040085) ‎ (← links)
• A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) ‎ (← links)
• Linear-time separation algorithms for the three-index assignment polytope (Q1801663) ‎ (← links)
• Randomized parallel algorithms for the multidimensional assignment problem (Q1826608) ‎ (← links)
• Fast separation for the three-index assignment problem (Q2398106) ‎ (← links)
• Decomposition and dynamic cut generation in integer linear programming (Q2490337) ‎ (← links)
• On multi-index assignment polytopes (Q2494661) ‎ (← links)
• Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem (Q5413067) ‎ (← links)