scientific article; zbMATH DE number 1161055

MaRDI QIDQ4393155zbMATH OpenFDO

Authors Xunren Ji

Publication date 19 October 1998

zbMATH Keywords

bi-directional searchlinear inequalitysimultaneous linear equationsstrongly polynomial algorithm

Mathematics Subject Classification ID

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

Recommendations

• A strongly polynomial algorithm for linear systems having a binary solution
• scientific article; zbMATH DE number 2208706
• Linear Programming in O([n3/ln n]L) Operations
• A strongly polynomial-time algorithm for a class of integer programming problems
• Publication:4488899

Cited in

(9)

• A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
• The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption
• scientific article; zbMATH DE number 4181141 (Why is no real title available?)
• scientific article; zbMATH DE number 3978821 (Why is no real title available?)
• scientific article; zbMATH DE number 4121753 (Why is no real title available?)
• A strongly polynomial algorithm for bimodular integer linear programming
• A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
• Complete Algorithms for Algebraic Strongest Postconditions and Weakest Preconditions in Polynomial ODE’S
• A strongly polynomial algorithm for linear systems having a binary solution

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 Q4393155)