Lower tolerance-based branch and bound algorithms for the ATSP (Q1761975): 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.1016/j.cor.2011.04.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2134248285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of traveling salesman problems / 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: Exact solution of large-scale, asymmetric traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4801179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-and-solve: An iterative search strategy for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Basics on Tolerances / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Hungarian assignment algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tolerance-based branch and bound algorithms for the ATSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An addendum on: ``Sensitivity analysis of the optimal assignment'' / rank
 
Normal rank

Latest revision as of 21:04, 5 July 2024

scientific article
Language Label Description Also known as
English
Lower tolerance-based branch and bound algorithms for the ATSP
scientific article

    Statements

    Lower tolerance-based branch and bound algorithms for the ATSP (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    branch and bound
    0 references
    asymmetric traveling salesman problem
    0 references
    tolerances
    0 references
    0 references
    0 references

    Identifiers