Interval estimation of a global optimum for large combinatorial problems (Q4181638): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/nav.3800260108 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076892394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point estimation of a global optimum for large combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3259350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A man-machine approach toward solving the traveling salesman problem / 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: Estimation of a truncation point / rank
 
Normal rank

Latest revision as of 00:17, 13 June 2024

scientific article; zbMATH DE number 3617931
Language Label Description Also known as
English
Interval estimation of a global optimum for large combinatorial problems
scientific article; zbMATH DE number 3617931

    Statements

    Interval estimation of a global optimum for large combinatorial problems (English)
    0 references
    0 references
    0 references
    1979
    0 references
    Interval Estimation
    0 references
    Large Combinatorial Problems
    0 references
    Computational Experience
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references