Pages that link to "Item:Q1176822"

The following pages link to On the finiteness of the criss-cross method (Q1176822):

Displaying 9 items.

• Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
• A basis enumeration algorithm for linear systems with geometric applications (Q1180318) (← links)
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← links)
• Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
• Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
• Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
• New variants of finite criss-cross pivot algorithms for linear programming (Q1610181) (← links)
• New variants of the criss-cross method for linearly constrained convex quadratic programming (Q1877024) (← links)
• A new proof for the criss-cross method for quadratic programming (Q4327956) (← links)