On the cycles generated by an arbitrary set of matrix elements

DOI10.1016/0041-5553(84)90250-7MaRDI QIDQ3712121zbMATH OpenOpenAlexFDO

Authors V. V. Zaika, S. M. Shvartin

Publication date 1984

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(84)90250-7

zbMATH Keywords

cyclesfeasible solutionlinear programming transportation problemsufficient condition for optimality

Mathematics Subject Classification ID

Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 3920187
• scientific article; zbMATH DE number 4110455
• On cycling in the simplex method of the transportation problem
• On the numerical solution of the transportation problem
• On justification of an approach to the minimum time transportation problem

Cited in

(8)

• Subclasses of solvable problems from classes of combinatorial optimization problems
• Paths and cycles as tools for the characterization of some classes of matrices
• CYCLES AND 1-UNCONDITIONAL MATRICES
• On cycling in the simplex method of the transportation problem
• scientific article; zbMATH DE number 3896661 (Why is no real title available?)
• A Tree Among the Stepping Stones
• scientific article; zbMATH DE number 1070669 (Why is no real title available?)
• On justification of an approach to the minimum time transportation problem

This page was built for publication: On the cycles generated by an arbitrary set of matrix elements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3712121)