On the stochastic complexity of the asymmetric traveling salesman problem (Q915656): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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/0377-2217(89)90230-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1984891736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A restricted Lagrangean approach to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathology of Traveling-Salesman Subtour-Elimination Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4151660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of solving the assignment problem for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new extension principle algorithm for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Trees and the Analysis of Branch and Bound Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3693257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3945940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some techniques useful for solution of transportation network problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:33, 21 June 2024

scientific article
Language Label Description Also known as
English
On the stochastic complexity of the asymmetric traveling salesman problem
scientific article

    Statements

    On the stochastic complexity of the asymmetric traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    polynomial bound
    0 references
    combinatorial analysis
    0 references
    discrete optimization
    0 references
    stochastic complexity
    0 references
    asymmetric traveling salesman
    0 references

    Identifiers