This article is cited in 8 papers

Mathematical Game Theory and Applications

A heuristic method for solving integer-valued decompositional multiindex problems

L. G. Afraimovich

Nizhni Novgorod State University, Nizhni Novgorod, Russia

Abstract: We consider NP-hard integer-valued multiindex problems of transportation type. We distinguish a subclass of polynomially solvable multiindex problems, namely multiindex problems with decomposition structure. We construct a general scheme for a heuristic method to solve a number of similar NP-hard decompositional multiindex problems. For one version of implementation for this scheme, we estimate its deviation from the optimum. We illustrate our results with the example of designing a class schedule.

Presented by the member of Editorial Board: A. A. Lazarev

Received: 16.11.2013

 English version: Automation and Remote Control, 2014, 75:8, 1357–1368

Bibliographic databases:

• 
•