Pages that link to "Item:Q2276881"
From MaRDI portal
The following pages link to Facets of the three-index assignment polytope (Q2276881):
Displaying 29 items.
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities (Q139206) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- On the orthogonal Latin squares polytope (Q819807) (← links)
- Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem (Q852261) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Facets of the axial three-index assignment polytope (Q908296) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- Clique facets of the axial and planar assignment polytopes (Q1040085) (← links)
- The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm (Q1068720) (← links)
- Geometric three-dimensional assignment problems (Q1278259) (← links)
- Approximation algorithms for multi-dimensional assignment problems with decomposable costs (Q1327216) (← links)
- On a family of \(0/1\)-polytopes with an NP-complete criterion for vertex nonadjacency relation (Q1741477) (← links)
- Types of maximum noninteger vertices of the relaxation polyhedron of the four-index axial assignment problem (Q1759247) (← 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)
- Using integer programming techniques for the solution of an experimental design problem (Q1904719) (← 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)
- Facets of the three-index assignment polytope (Q2276881) (← links)
- Fast separation for the three-index assignment problem (Q2398106) (← links)
- Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem (Q2458107) (← links)
- Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)
- On multi-index assignment polytopes (Q2494661) (← links)
- A characterization of odd-hole inequalities related to Latin squares (Q2868928) (← links)
- Improved Computational Approaches and Heuristics for Zero Forcing (Q5084604) (← links)
- (Q5228454) (← links)
- Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem (Q5413067) (← links)
- A new efficiently solvable special case of the three-dimensional axial bottleneck assignment problem (Q6567677) (← links)
