An Algorithm for the Three-Index Assignment Problem
From MaRDI portal
Recommendations
Cited in
(55)- New lower bounds for the triplanar assignment problem. Use of the classical model
- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
- Clique facets of the axial and planar assignment polytopes
- Lower bounds for the axial three-index assignment problem
- Geometric three-dimensional assignment problems
- 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
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Approximation algorithms for multi-index transportation problems with decomposable costs
- Extending single tolerances to set tolerances
- A branch-and-cut procedure for the Udine course timetabling problem
- Test problem generator for the multidimensional assignment problem
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- Linear-time separation algorithms for the three-index assignment polytope
- Scheduling sports competitions on multiple venues.
- Three-dimensional axial assignment problems with decomposable cost coefficients
- Global tolerances in the problems of combinatorial optimization with an additive objective function
- Decomposition method for solving a three-index planar assignment problem
- Solving the multidimensional assignment problem by a cross-entropy method
- Combining solutions of the axial assignment problem
- Heuristic strategies for combining solutions of the three-index axial assignment problem
- 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 heuristic method for solving integer-valued decompositional multiindex problems
- An adaptive algorithm for solving the axial three-index assignment problem
- On representatives of multi-index transportation problems
- Fast separation for the three-index assignment problem
- The three-dimensional assignment and partition problems. New lower bounds
- Decomposition and dynamic cut generation in integer linear programming
- On multi-index assignment polytopes
- Spectral decompositions and feasible directions in the axial three-index assignment problem
- A characterization of odd-hole inequalities related to Latin squares
- Exact solution of emerging quadratic assignment problems
- Local search heuristics for the multidimensional assignment problem
- Efficient computation of tolerances in the weighted independent set problem for trees
- scientific article; zbMATH DE number 151870 (Why is no real title available?)
- Extremal values of global tolerances in combinatorial optimization with an additive objective function
- A Branch & Cut algorithm for a four-index assignment problem
- scientific article; zbMATH DE number 2097292 (Why is no real title available?)
- Investigation of polynomial algorithms for solving the three-index planar assignment problem
- Branch and bound algorithms for the multidimensional assignment problem
- Local search heuristics for the multidimensional assignment problem
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
- On optimality of a polynomial algorithm for random linear multidimensional assignment problem
- Criteria convolutions when combining the solutions of the multicriteria axial assignment problem
- Selected topics on assignment problems
- Solution approaches to the three-index assignment problem
- A hybrid genetic algorithm for the three-index assignment problem
- A survey for the quadratic 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
- Facets of the axial three-index assignment polytope
- A survey of dynamic network flows
- Random assignment problems
This page was built for publication: An Algorithm for the Three-Index Assignment Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3981514)
