A Phase I that solves transportation problems

DOI10.1007/978-3-642-77489-8_31MaRDI QIDQ4035650zbMATH OpenOpenAlexFDO

Authors Konstantinos Paparrizos

Publication date 18 May 1993

Published in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-77489-8_31

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• On the initialization methods of an exterior point algorithm for the assignment problem
• An infeasible (exterior point) simplex algorithm for assignment problems
• scientific article; zbMATH DE number 1795712
• Efficient dual simplex algorithms for the assignment problem
• Computational experience with exterior point algorithms for the transportation problem

Cited in

(4)

• Exterior point simplex-type algorithms for linear and network optimization problems
• On the initialization methods of an exterior point algorithm for the assignment problem
• Computational experience with exterior point algorithms for the transportation problem
• An infeasible (exterior point) simplex algorithm for assignment problems

This page was built for publication: A Phase I that solves transportation problems

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