An adaptive algorithm for solving the axial three-index assignment problem

DOI10.1134/S000511791904009XzbMath1431.93038OpenAlexW2940946052WikidataQ127968021 ScholiaQ127968021MaRDI QIDQ2290404

O. A. Medvedeva, S. N. Medvedev

Publication date: 27 January 2020

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s000511791904009x

zbMATH Keywords

adaptive algorithmdiscrete optimizationaxial three-index assignment problemlocal improvement conditionprobabilistic setup

Mathematics Subject Classification ID

Adaptive control/observation systems (93C40) Computational methods for problems pertaining to systems and control theory (93-08)

Related Items (3)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hybrid genetic algorithm for the three-index assignment problem
• Types of maximum noninteger vertices of the relaxation polyhedron of the four-index axial assignment problem
• Three-dimensional axial assignment problems with decomposable cost coefficients
• GRASP with Path Relinking for Three-Index Assignment
• Reducibility among Combinatorial Problems
• On solvability of the axial 8-index assignment problem on single-cycle permutations
• Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem

This page was built for publication: An adaptive algorithm for solving the axial three-index assignment problem