Polynomial Algorithms for Linear Programming

Lecture Notes in Economics and Mathematical Systems- Germany

doi 10.1007/978-3-642-46629-8_4

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Berlin Heidelberg

Related search

A Polynomial Projection-Type Algorithm for Linear Programming

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2014English

Algorithms for Solving Non-Linear Programming Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1975English

A Class of Polynomial Volumetric Barrier Decomposition Algorithms for Stochastic Semidefinite Programming

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2010English

Two Linear Programming Algorithms for the Linear Discrete $L\sb {1}$ Norm Problem

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1979English

A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
1993English

Sparsity-Preserving SOR Algorithms for Separable Quadratic and Linear Programming.

1981English

An Optimal Basis Identification Technique for Interior-Point Linear Programming Algorithms

1990English

Polynomial Algorithms for Perfect Graphs

North-Holland Mathematics Studies
1984English

On the Worst Case Complexity of Potential Reduction Algorithms for Linear Programming

Mathematical Programming, Series B
MathematicsSoftware
1997English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy