An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
From MaRDI portal
Publication:3916373
DOI10.2307/2581852zbMath0464.90055WikidataQ57401647 ScholiaQ57401647MaRDI QIDQ3916373
Publication date: 1981
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2581852
65K05: Numerical mathematical programming methods
90B35: Deterministic scheduling theory in operations research
90C09: Boolean programming
Related Items
Approximation algorithms for three-dimensional assignment problems with triangle inequalities, Selected topics on assignment problems, A survey for the quadratic assignment problem, A survey of dynamic network flows, New lower bounds for the triplanar assignment problem. Use of the classical model, An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors, Clique facets of the axial and planar assignment polytopes, Lower bounds for the axial three-index assignment problem, The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm, Reformulating nonlinear combinatorial optimization problems for higher computational efficiency, Approximation algorithms for multi-dimensional assignment problems with decomposable costs, Approximation algorithms for multi-index transportation problems with decomposable costs, Timetable planning using the constraint-based reasoning, Test problem generator for the multidimensional assignment problem, Linear-time separation algorithms for the three-index assignment polytope, Scheduling sports competitions on multiple venues., Complexity of a 3-dimensional assignment problem, Facets of the three-index assignment polytope, The three-dimensional assignment and partition problems. New lower bounds, Some assignment problems arising from multiple target tracking, On multi-index assignment polytopes
