A hybrid genetic algorithm for the three-index assignment problem
From MaRDI portal
Publication:818096
DOI10.1016/j.ejor.2004.09.042zbMath1116.90070OpenAlexW2029952127MaRDI QIDQ818096
Gaofeng Huang, Andrew E. B. Lim
Publication date: 24 March 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.09.042
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (11)
Index Matrices as a Cost Optimization Tool of Resource Provisioning in Uncertain Cloud Computing Environment ⋮ Facets of the axial three-index assignment polytope ⋮ Three-index linear programs with nested structure ⋮ Local search heuristics for the multidimensional assignment problem ⋮ An adaptive algorithm for solving the axial three-index assignment problem ⋮ Combining solutions of the axial assignment problem ⋮ ONE IMPROVED AGENT GENETIC ALGORITHM — RING-LIKE AGENT GENETIC ALGORITHM FOR GLOBAL NUMERICAL OPTIMIZATION ⋮ A TWO-STATE ANT COLONY ALGORITHM FOR SOLVING THE MINIMUM GRAPH BISECTION PROBLEM ⋮ Heuristic strategies for combining solutions of the three-index axial assignment problem ⋮ Local Search Heuristics for the Multidimensional Assignment Problem ⋮ Lower bounds for the axial three-index assignment problem
Cites Work
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- Three-dimensional axial assignment problems with decomposable cost coefficients
- GRASP with Path Relinking for Three-Index Assignment
- An Algorithm for the Three-Index Assignment Problem
- Letter to the Editor—The Multidimensional Assignment Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A hybrid genetic algorithm for the three-index assignment problem
