An Algorithm for the Three-Index Assignment Problem
From MaRDI portal
Publication:3981514
DOI10.1287/opre.39.1.150zbMath0743.90079OpenAlexW2006743657MaRDI QIDQ3981514
Egon Balas, Matthew J. Saltzman
Publication date: 26 June 1992
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.39.1.150
Lagrangian relaxationapproximationbranch-and-boundpolyhedral combinatoricsaxial three-index assignment
Integer programming (90C10) Discrete location and assignment (90B80) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A hybrid genetic algorithm for the three-index assignment problem, The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems, An algorithm for the planar three-index assignment problem, On representatives of multi-index transportation problems, Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem, A survey for the quadratic assignment problem, Branch and bound algorithms for the multidimensional assignment problem, Approximation algorithms for multi-index transportation problems with decomposable costs, Fast separation for the three-index assignment problem, On the number of local minima for the multidimensional assignment problem, Asymptotic behavior of the expected optimal value of the multidimensional assignment problem, Three-dimensional axial assignment problems with decomposable cost coefficients, Extending single tolerances to set tolerances, Efficient computation of tolerances in the weighted independent set problem for trees, Global tolerances in the problems of combinatorial optimization with an additive objective function, Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem, On optimality of a polynomial algorithm for random linear multidimensional assignment problem, Facets of the axial three-index assignment polytope, A survey of dynamic network flows, Extremal values of global tolerances in combinatorial optimization with an additive objective function, The three-dimensional assignment and partition problems. New lower bounds, Exact solution of emerging quadratic assignment problems, Random assignment problems, On a property of a three-dimensional matrix, A tolerance-based heuristic approach for the weighted independent set problem, Integer programming models for the multidimensional assignment problem with star costs, A branch-and-cut procedure for the Udine course timetabling problem, Selected topics on assignment problems, Local search heuristics for the multidimensional assignment problem, A heuristic method for solving integer-valued decompositional multiindex problems, Decomposition and dynamic cut generation in integer linear programming, Solving the multidimensional assignment problem by a cross-entropy method, On multi-index assignment polytopes, Test problem generator for the multidimensional assignment problem, A performance guarantee heuristic for electronic components placement problems including thermal effects, New lower bounds for the triplanar assignment problem. Use of the classical model, Linear-time separation algorithms for the three-index assignment polytope, Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems, Combining solutions of the axial assignment problem, Scheduling sports competitions on multiple venues., Geometric three-dimensional assignment problems, Heuristic strategies for combining solutions of the three-index axial assignment problem, Local Search Heuristics for the Multidimensional Assignment Problem, Clique facets of the axial and planar assignment polytopes, Lower bounds for the axial three-index assignment problem, A characterization of odd-hole inequalities related to Latin squares
