scientific article; zbMATH DE number 1161055
From MaRDI portal
Publication:4393155
zbMATH Open0897.90146MaRDI QIDQ4393155
Publication date: 19 October 1998
Title of this publication is not available (Why is that?)
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)
Related Items (7)
A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables ⋮ A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs ⋮ Title not available (Why is that?) ⋮ Complete Algorithms for Algebraic Strongest Postconditions and Weakest Preconditions in Polynomial ODE’S ⋮ A strongly polynomial algorithm for bimodular integer linear programming ⋮ The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption ⋮ 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 Q4393155)
