scientific article; zbMATH DE number 898014

zbMATH Open0847.90100MaRDI QIDQ4884975FDOQ4884975

Authors: C. C. Gonzaga 

Publication date: 8 July 1996

Title of this publication is not available (Why is that?)

Recommendations

• Linear Programming in O([n3/ln n]L) Operations
• A simple complexity proof for a polynomial-time linear programming algorithm
• scientific article; zbMATH DE number 19091
• A new polynomial-time algorithm for linear programming

zbMATH Keywords

short step primal-dual path following algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (10)

• On the Teaching Complexity of Linear Sets
• Linear programming, complexity. Separation and optimization.
• A decision procedure for linear ``big O equations
• Irredundant lattice representations of continuous piecewise affine functions
• On the complexity of linear programming in the BSS-model
• Title not available (Why is that?)
• A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
• A simple complexity proof for a polynomial-time linear programming algorithm
• On the teaching complexity of linear sets
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4884975)