Teaming interior and combinatorial algorithms for linear programming.

This paper introduces several algorithms for linear programming which verifies 3 properties: they have complementary times complexity features (one being polynomial times), they can exchange their current points, and, they work with related goal. It seems to be the first portfolio of algorithm verifying such properties.