Low order polynomial bounds on the expected performance of local improvement algorithms (Q4721084): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3966899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets of Lattice Points which Contain a Maximal Number of Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary pivot theory of mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Observations on a class of nasty linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lengths of snakes in boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Location Problems on Tree Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of LCPs associated with positive definite symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Heuristic Procedures for Integer Linear Programming with an Interior / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simplex algorithm with the pivot rule of maximizing criterion improvement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4052170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4066843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple heuristic approach to simplex efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hill Climbing with Multiple Local Optima / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of iterations of local improvement algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131064 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01580647 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973735752 / rank
 
Normal rank

Latest revision as of 09:59, 30 July 2024

scientific article; zbMATH DE number 3993298
Language Label Description Also known as
English
Low order polynomial bounds on the expected performance of local improvement algorithms
scientific article; zbMATH DE number 3993298

    Statements

    Low order polynomial bounds on the expected performance of local improvement algorithms (English)
    0 references
    0 references
    1986
    0 references
    average performance of algorithms
    0 references
    extremal set theory
    0 references
    local improvement
    0 references
    principal pivoting
    0 references
    linear complementarity
    0 references
    hill climbing in artificial intelligence
    0 references

    Identifiers

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