scientific article; zbMATH DE number 3758081

zbMATH Open0482.90061MaRDI QIDQ3941189FDOQ3941189

Authors: Eugene L. Lawler 

Publication date: 1982

Full work available at URL: https://eudml.org/doc/37250

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

zbMATH Keywords

computational complexitypolynomial algorithmellipsoid methodKhachiyan's algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25)

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