Pages that link to "Item:Q4096702"

The following pages link to The factorization approach to large-scale linear programming (Q4096702):

Displaying 17 items.

• A specialized network simplex algorithm for the constrained maximum flow problem (Q531424) (← links)
• Basis properties and algorithmic specializations for GUB transformed networks (Q786644) (← links)
• Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm (Q868125) (← links)
• A network-related nuclear power plant model with an intelligent branch- and-bound solution approach (Q917441) (← links)
• Solving embedded generalized network problems (Q1058978) (← links)
• Representing inverses in pure network flow optimization (Q1068691) (← links)
• Modeling of building evacuation problems by network flows with side constraints (Q1098760) (← links)
• Exploiting special structure in Karmarkar's linear programming algorithm (Q1106098) (← links)
• Hidden Z-matrices with positive principal minors (Q1260088) (← links)
• Dynamic factorization in large-scale optimization (Q1330893) (← links)
• Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly (Q2371467) (← links)
• Automatic identification of embedded network rows in large-scale optimization models (Q3315283) (← links)
• Large-scale linear programming: Geometry, working bases and factorizations (Q3664825) (← links)
• Extracting embedded generalized networks from linear programming problems (Q3693261) (← links)
• A bump triangular dynamic factorization algorithm for the simplex method (Q3865837) (← links)
• Testing of a large-scale network optimization program (Q4171521) (← links)
• (Q5020878) (← links)