Pages that link to "Item:Q4749597"
From MaRDI portal
The following pages link to Polynomial algorithms for a class of linear programs (Q4749597):
Displaying 10 items.
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- Projection algorithms for linear programming (Q1199509) (← links)
- An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing (Q1734819) (← links)
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities (Q1922692) (← links)
- Sampling Kaczmarz-Motzkin method for linear feasibility problems: generalization and acceleration (Q2149567) (← links)
- On Chubanov's Method for Linear Programming (Q2962562) (← links)
- A decomposition property of polyhedra (Q3703640) (← links)
- Scaling: A general framework (Q3730337) (← links)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)
- A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility (Q5372620) (← links)