Pages that link to "Item:Q1333481"
From MaRDI portal
The following pages link to An algorithm for the planar three-index assignment problem (Q1333481):
Displaying 21 items.
- A reduction approach to the repeated assignment problem (Q531433) (← links)
- Round robin tournaments and three index assignments (Q633482) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- A hybrid genetic algorithm for the three-index assignment problem (Q818096) (← links)
- On the orthogonal Latin squares polytope (Q819807) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- New lower bounds for the triplanar assignment problem. Use of the classical model (Q1003082) (← links)
- Clique facets of the axial and planar assignment polytopes (Q1040085) (← links)
- Test problem generator for the multidimensional assignment problem (Q1774571) (← links)
- Scheduling sports competitions on multiple venues. (Q1810517) (← links)
- Tabu search for the planar three-index assignment problem (Q1923786) (← links)
- Decomposition method for solving a three-index planar assignment problem (Q1995353) (← links)
- An adaptive algorithm for solving the axial three-index assignment problem (Q2290404) (← links)
- A new class of facets for the Latin square polytope (Q2492192) (← links)
- On multi-index assignment polytopes (Q2494661) (← links)
- Fast local search algorithms for the handicapped persons transportation problem (Q2573013) (← links)
- A characterization of odd-hole inequalities related to Latin squares (Q2868928) (← links)
- An Algorithm for the Three-Index Assignment Problem (Q3981514) (← links)
- A Branch & Cut algorithm for a four-index assignment problem (Q4661104) (← links)
- Efficient algorithms for three‐dimensional axial and planar random assignment problems (Q5175234) (← links)
- On Asymptotically Optimal Algorithm for One Modification of Planar 3-dimensional Assignment Problem (Q5391757) (← links)
