Performance evaluation of a family of criss-cross algorithms for linear programming

DOI10.1111/1475-3995.00392zbMath1064.90024OpenAlexW2169198345MaRDI QIDQ4806913

Nelson F. Maculan, Tibérius O. Bonates

Publication date: 23 June 2003

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/1475-3995.00392

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (1)

On the existence of a short pivoting sequence for a linear program

Uses Software

• XPRESS

Cites Work

• On the finiteness of the criss-cross method
• Implementing the Simplex Method: The Initial Basis
• Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach

This page was built for publication: Performance evaluation of a family of criss-cross algorithms for linear programming