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.
机构:
St Petersburg State Univ, Math & Mech Fac, St Petersburg 198504, RussiaSt Petersburg State Univ, Math & Mech Fac, St Petersburg 198504, Russia
Volkov, V. V.
Petrov, F. V.
论文数: 0引用数: 0
h-index: 0
机构:
St Petersburg State Univ, Math & Mech Fac, St Petersburg 198504, Russia
Russian Acad Sci, St Petersburg Dept, Steklov Inst Math, St Petersburg 191023, RussiaSt Petersburg State Univ, Math & Mech Fac, St Petersburg 198504, Russia
机构:
SUNY Coll Old Westbury, Dept Math Comp & Informat Sci, 223 Store Hill Rd, Old Westbury, NY 11568 USASUNY Coll Old Westbury, Dept Math Comp & Informat Sci, 223 Store Hill Rd, Old Westbury, NY 11568 USA