An adaptive algorithm for solving the axial three-index assignment problem
From MaRDI portal
Publication:2290404
Recommendations
- An Algorithm for the Three-Index Assignment Problem
- scientific article; zbMATH DE number 2097292
- An algorithm for the planar three-index assignment problem
- An asymptotically exact algorithm for one modification of planar three-index assignment
- Decomposition method for solving a three-index planar assignment problem
Cites work
- scientific article; zbMATH DE number 3482073 (Why is no real title available?)
- scientific article; zbMATH DE number 3240945 (Why is no real title available?)
- scientific article; zbMATH DE number 3331326 (Why is no real title available?)
- scientific article; zbMATH DE number 4187451 (Why is no real title available?)
- A hybrid genetic algorithm for the three-index assignment problem
- Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem
- GRASP with path relinking for three-index assignment
- On solvability of the axial 8-index assignment problem on single-cycle permutations
- Reducibility among combinatorial problems
- Three-dimensional axial assignment problems with decomposable cost coefficients
- Types of maximum noninteger vertices of the relaxation polyhedron of the four-index axial assignment problem
Cited in
(5)- Lower bounds for the axial three-index assignment problem
- Greedy and adaptive algorithms for multi-depot vehicle routing with object alternation
- Combining solutions of the axial assignment problem
- Heuristic strategies for combining solutions of the three-index axial assignment problem
- scientific article; zbMATH DE number 2097292 (Why is no real title available?)
This page was built for publication: An adaptive algorithm for solving the axial three-index assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290404)