Polytopes, graphs and optimisation
Polytopes, graphs and optimisation
Theory of linear and integer programming
Theory of linear and integer programming
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Approximation algorithms for multi-dimensional assignment problems with decomposable costs
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Computational Optimization and Applications
An O(n2(m + Nlog n)log n) min-cost flow algorithm
Journal of the ACM (JACM)
Three-dimensional axial assignment problems with decomposable cost coefficients
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Approximation algorithms for multi-index transportation problems with decomposable costs
GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An LP-based algorithm for the data association problem in multitarget tracking
Computers and Operations Research
Extracting pure network submatrices in linear programs using signed graphs
Discrete Applied Mathematics
Multiindex resource distributions for hierarchical systems
Automation and Remote Control
New lower bounds for the triplanar assignment problem. Use of the classical model
Automation and Remote Control
Graphs of transportation polytopes
Journal of Combinatorial Theory Series A
Three-Index linear programs with nested structure
Automation and Remote Control
| Hi-index | 0.00 |
Consideration was given to the multi-index problems of linear and integer linear programming of the transport type. An approach based on the study of reducibility of the multi-index transport problems to that of seeking a flow on the network was proposed. For the multi-index problems with decomposition structure, a reduction scheme enabling one to solve the original multi-index problem using the cyclic decomposition of the minimum-cost flow of the auxiliary flow problem was constructed. The developed method underlies the heuristic algorithm to solve the NP-hard integer multi-index problem with a system of constraints featuring decompositional properties and general cost matrix.