George Dantzig's impact on the theory of computation (Q951091): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2006.12.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965311270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4123077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRIMES is in P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4457509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shortest Route Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Significance of Solving Linear Programming Problems with Some Integer Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outline of an algorithm for integer solutions to linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quasi-polynomial bound for the diameter\\of graphs of polyhedra / 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: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized polynomial-time simplex algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average number of steps of the simplex method of linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial minimum cost circulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank

Latest revision as of 18:21, 28 June 2024

scientific article
Language Label Description Also known as
English
George Dantzig's impact on the theory of computation
scientific article

    Statements

    George Dantzig's impact on the theory of computation (English)
    0 references
    0 references
    29 October 2008
    0 references
    linear programming
    0 references
    simplex algorithm
    0 references
    combinatorial optimization
    0 references
    integer programming
    0 references
    computational complexity
    0 references
    polynomial-time algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references