An algorithm for the planar three-index assignment problem
From MaRDI portal
Publication:1333481
DOI10.1016/0377-2217(94)90034-5zbMath0810.90093OpenAlexW2042403544MaRDI QIDQ1333481
Publication date: 15 September 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90034-5
branch-and-boundsubgradient optimizationLagrangean relaxation schemeLatin square structureplanar three-index assignment
Related Items
On the orthogonal Latin squares polytope ⋮ A survey for the quadratic assignment problem ⋮ Round robin tournaments and three index assignments ⋮ A reduction approach to the repeated assignment problem ⋮ Selected topics on assignment problems ⋮ A new class of facets for the Latin square polytope ⋮ On multi-index assignment polytopes ⋮ Test problem generator for the multidimensional assignment problem ⋮ Scheduling sports competitions on multiple venues. ⋮ Clique facets of the axial and planar assignment polytopes ⋮ Fast local search algorithms for the handicapped persons transportation problem ⋮ A characterization of odd-hole inequalities related to Latin squares
Cites Work
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- On Latin squares and the facial structure of related polytopes
- Complexity of a 3-dimensional assignment problem
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- New Methods in Mathematical Programming—The Solid Transportation Problem
- The reconstruction of latin squares with applications to school timetabling and to experimental design
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- An Algorithm for the Three-Index Assignment Problem
- Set Partitioning: A survey
- The Multi-Index Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
