scientific article; zbMATH DE number 828002

zbMATH Open0837.90085MaRDI QIDQ4858968FDOQ4858968

Authors: Bahman Kalantari 

Publication date: 29 January 1996

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

Recommendations

• Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)
• Small-dimensional linear programming and convex hulls made easy
• Linear Programming in Linear Time When the Dimension Is Fixed
• scientific article; zbMATH DE number 4016589
• A new polynomial-time algorithm for linear programming

zbMATH Keywords

polynomial time algorithmconvex hull problemKarmarkar's algorithmgeneral linear programming

Mathematics Subject Classification ID

Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (9)

• A sublogarithmic convex hull algorithm
• LATIN 2004: Theoretical Informatics
• Title not available (Why is that?)
• A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices
• An algorithm for the construction of convex hulls in simple integer recourse programming
• A general algorithm for determining all essential solutions and inequalities for any convex polyhedron
• On linear programming and matrix scaling over the algebraic numbers
• Linear programming approaches to the convex hull problem in \(\mathbb{R}^ m\)
• On the complexity of general matrix scaling and entropy minimization via the RAS algorithm

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