A heuristic method for solving integer-valued decompositional multiindex problems

DOI10.1134/S0005117914080013zbMath1307.90107MaRDI QIDQ2261778

L. G. Afraimovich

Publication date: 13 March 2015

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

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29)

Related Items (4)

Hybrid particle swarm optimization for pure integer linear solid transportation problem ⋮ Multi-index transportation problems with 1-nested structure ⋮ 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for three-dimensional assignment problems with triangle inequalities
• Multiindex optimal production planning problems
• Round robin tournaments and three index assignments
• \(N\)-fold integer programming
• New lower bounds for the triplanar assignment problem. Use of the classical model
• A three-dimensional matching model for perishable production scheduling
• Multicriteria distribution of a homogeneous resource in hierarchical systems
• An integer programming formulation for a case study in university timetabling.
• Axial three-index assignment and traveling salesman problems: fast approximate algorithms and their probabilistic analysis
• A data structure for dynamic trees
• Tabu search for the planar three-index assignment problem
• Multi-index transport problems with decomposition structure
• Scheduling sports competitions at multiple venues -- revisited
• Multiindex resource distributions for hierarchical systems
• Integer Programming with a Fixed Number of Variables
• An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
• An Algorithm for the Three-Index Assignment Problem
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm

This page was built for publication: A heuristic method for solving integer-valued decompositional multiindex problems