Further extension of the TSP assign neighborhood (Q2491321): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
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.1007/s10732-005-3487-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013414255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Travelling Salesman and the PQ-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new ILP-based refinement heuristic for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data structures and ejection chains for solving large-scale traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential neighbourhood local search for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on ATSP neighborhood size. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem: new polynomial approximation algorithms and domination analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461910 / rank
 
Normal rank

Latest revision as of 16:11, 24 June 2024

scientific article
Language Label Description Also known as
English
Further extension of the TSP assign neighborhood
scientific article

    Statements

    Further extension of the TSP assign neighborhood (English)
    0 references
    0 references
    0 references
    29 May 2006
    0 references
    0 references
    traveling salesman problem
    0 references
    local search
    0 references
    exponential neighborhood
    0 references
    assign neighborhood
    0 references
    0 references