Cycle-based reducibility of multi-index transport-type systems of linear inequalities

DOI10.1134/S106423071004009XzbMath1273.90166MaRDI QIDQ357096

L. G. Afraimovich

Publication date: 29 July 2013

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Mathematics Subject Classification ID

Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multicriterial multi-index resource scheduling problems
• Multicommodity flows in tree-like networks
• Graphs of transportation polytopes
• A recognition problem in converting linear programming to network flow models
• Extracting pure network submatrices in linear programs using signed graphs.
• Complexity of a 3-dimensional assignment problem
• Asymptotic optimality of a transport-problem plan constructed by the minimum-element method
• On representatives of multi-index transportation problems
• Multiindex resource distributions for hierarchical systems
• Beyond the flow decomposition barrier
• An O (n ² (m + N log n )log n ) min-cost flow algorithm
• Impaired flow multi-index transportation problem with axial constraints
• The Relaxation Method for Linear Inequalities

This page was built for publication: Cycle-based reducibility of multi-index transport-type systems of linear inequalities