A subexponential bound for linear programming (Q1923862): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q54309309, #quickstatements; #temporary_batch_1711574657256
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Helly-type theorems and generalized linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem Concerning the Integer Lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: New applications of random sampling in computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Las Vegas algorithms for linear and integer programming when the dimension is small / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über das Löwnersche Ellipsoid und sein Analogon unter den einem Eikörper einbeschriebenen Ellipsoiden / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized algorithm for fixed-dimensional linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subexponential Algorithm for Abstract Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ellipsoid coverings with minimal volumina. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for a subexponential optimization algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming in Linear Time When the Dimension Is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on approximate linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An observation on the structure of production sets with indivisibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-dimensional linear programming and convex hulls made easy / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01940877 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2152479402 / rank
 
Normal rank

Latest revision as of 10:23, 30 July 2024

scientific article
Language Label Description Also known as
English
A subexponential bound for linear programming
scientific article

    Statements

    A subexponential bound for linear programming (English)
    0 references
    0 references
    18 February 1997
    0 references
    combinatorial optimization
    0 references
    randomized incremental algorithms
    0 references
    0 references
    0 references
    0 references

    Identifiers